更新 problem 20、24、82、83、86、88、92、412

Algorithms/24. Swap Nodes in Pairs/README.md

@@ -4,13 +4,15 @@
 
 Given a linked list, swap every two adjacent nodes and return its head.
 
+You may not modify the values in the list's nodes, only nodes itself may be changed.
+
+
+
 Example:
 
+```c
 Given 1->2->3->4, you should return the list as 2->1->4->3.
-Note:
-
-Your algorithm should use only constant extra space.
-You may not modify the values in the list's nodes, only nodes itself may be changed.
+```
 
 ## 题目大意
 

Algorithms/88. Merge-Sorted-Array/README.md

@@ -4,7 +4,8 @@
 
 Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
 
-Note:
+Note:  
+
 You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
 
 ## 题目大意