add 508

Author: geemaple

README.md

@@ -45,7 +45,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [9c-dp.md](./list/9c-dp.md) | 42/45 | 3 vips |
 | [✅] | [geekbang.md](./list/geekbang.md) | 55/55 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
-| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 67/92 | 17 vips |
+| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 69/92 | 17 vips |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/40 | - |
 | [🔲] | [leetcode-google.md](./list/leetcode-google.md) | 0/7 | - |
 
@@ -528,7 +528,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Sorting
 
-| Link | Problem(28) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(29) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-15](https://leetcode.com/problems/3sum/) | 3Sum | [c++](./leetcode/15.3sum.cpp), [python3](./leetcode/15.3sum.py) | Sorting | O\(N^2\) | O\(1\) | - |
 | [Leetcode-18](https://leetcode.com/problems/4sum/) | 4Sum | [c++](./leetcode/18.4sum.cpp), [python3](./leetcode/18.4sum.py) | Sorting | O\(N^3\) | O\(1\) | - |
@@ -558,6 +558,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Leetcode-242](https://leetcode.com/problems/valid-anagram/) | Valid Anagram | [c++](./leetcode/242.valid-anagram.cpp), [python3](./leetcode/242.valid-anagram.py) | Sorting | O\(N\) | O\(1\) | - |
 | [Lintcode-919](https://www.lintcode.com/problem/meeting-rooms-ii/) | Meeting Rooms II | [c++](./lintcode/919.meeting-rooms-ii.cpp), [python3](./lintcode/919.meeting-rooms-ii.py) | Sorting | O\(NlogN\) | O\(N\) | Leetcode-253 |
 | [Lintcode-39](https://www.lintcode.com/problem/recover-rotated-sorted-array/) | Recover Rotated Sorted Array | [c++](./lintcode/39.recover-rotated-sorted-array.cpp), [python3](./lintcode/39.recover-rotated-sorted-array.py) | Sorting | O\(N\) | O\(1\) | - |
+| [Lintcode-508](https://www.lintcode.com/problem/wiggle-sort/) | Wiggle Sort | [c++](./lintcode/508.wiggle-sort.cpp), [python3](./lintcode/508.wiggle-sort.py) | Sorting | O\(N\) | O\(1\) | Leetcode-280 |
 
 ## Counting
 
@@ -816,7 +817,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Other
 
-| Link | Problem(137) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(136) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-16](https://leetcode.com/problems/3sum-closest/) | 3Sum Closest | [c++](./leetcode/16.3sum-closest.cpp), [python3](./leetcode/16.3sum-closest.py) | Other | \- | \- | - |
 | [Leetcode-454](https://leetcode.com/problems/4sum-ii/) | 4Sum II | [c++](./leetcode/454.4sum-ii.cpp) | Other | \- | \- | - |
@@ -939,7 +940,6 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Leetcode-125](https://leetcode.com/problems/valid-palindrome/) | Valid Palindrome | [c++](./leetcode/125.valid-palindrome.cpp), [python3](./leetcode/125.valid-palindrome.py) | Other | \- | \- | - |
 | [Leetcode-408](https://leetcode.com/problems/valid-word-abbreviation/) | Valid Word Abbreviation | [c++](./leetcode/408.valid-word-abbreviation.cpp), [python3](./leetcode/408.valid-word-abbreviation.py) | Other | \- | \- | - |
 | [Leetcode-286](https://leetcode.com/problems/walls-and-gates/) | Walls And Gates | [c++](./leetcode/286.walls-and-gates.cpp), [python3](./leetcode/286.walls-and-gates.py) | Other | \- | \- | - |
-| [Leetcode-280](https://leetcode.com/problems/wiggle-sort/) | Wiggle Sort | [python3](./leetcode/280.wiggle-sort.py) | Other | \- | \- | - |
 | [Leetcode-324](https://leetcode.com/problems/wiggle-sort-ii/) | Wiggle Sort II | [python3](./leetcode/324.wiggle-sort-ii.py) | Other | \- | \- | - |
 | [Leetcode-527](https://leetcode.com/problems/word-abbreviation/) | Word Abbreviation | [c++](./leetcode/527.word-abbreviation.cpp), [python3](./leetcode/527.word-abbreviation.py) | Other | \- | \- | - |
 | [Leetcode-127](https://leetcode.com/problems/word-ladder/) | Word Ladder | [c++](./leetcode/127.word-ladder.cpp), [python3](./leetcode/127.word-ladder.py) | Other | \- | \- | - |

leetcode/280.wiggle-sort.py

@@ -0,0 +1,53 @@
+//  Tag: Quick Select, Sort
+//  Time: O(N)
+//  Space: O(1)
+//  Ref: Leetcode-280
+//  Note: -
+
+//  Given an unsorted array `nums`, reorder it **in-place** such that 
+//  
+//  ```
+//  nums[0] <= nums[1] >= nums[2] <= nums[3]....
+//  ```
+//  
+//  There may have multiple answers for a question, **you only need to consider one of the possibilities**.
+//  
+//  **Example 1:**
+//  
+//  ```
+//  Input: [3, 5, 2, 1, 6, 4]
+//  Output: [1, 6, 2, 5, 3, 4]
+//  Explanation: This question may have multiple answers, and [2, 6, 1, 5, 3, 4] is also ok.
+//  ```
+//  
+//  **Example 2:**
+//  
+//  ```
+//  Input: [1, 2, 3, 4]
+//  Output: [1, 4, 2, 3]
+//  ```
+//  
+//  Please sort the array in place and do not define additional arrays.
+
+class Solution {
+public:
+    /**
+     * @param nums: A list of integers
+     * @return: nothing
+     */
+    void wiggleSort(vector<int> &nums) {
+        // write your code here
+        int n = nums.size();
+        for (int i = 1; i < n; i++) {
+            if (i & 1 == 1) {
+                if (nums[i] < nums[i - 1]) {
+                    swap(nums[i], nums[i - 1]);
+                }
+            } else {
+                if (nums[i] > nums[i - 1]) {
+                    swap(nums[i], nums[i - 1]);
+                }
+            }
+        }
+    }
+};

lintcode/508.wiggle-sort.cpp

@@ -0,0 +1,50 @@
+#  Tag: Quick Select, Sort
+#  Time: O(N)
+#  Space: O(1)
+#  Ref: Leetcode-280
+#  Note: -
+
+#  Given an unsorted array `nums`, reorder it **in-place** such that 
+#  
+#  ```
+#  nums[0] <= nums[1] >= nums[2] <= nums[3]....
+#  ```
+#  
+#  There may have multiple answers for a question, **you only need to consider one of the possibilities**.
+#  
+#  **Example 1:**
+#  
+#  ```
+#  Input: [3, 5, 2, 1, 6, 4]
+#  Output: [1, 6, 2, 5, 3, 4]
+#  Explanation: This question may have multiple answers, and [2, 6, 1, 5, 3, 4] is also ok.
+#  ```
+#  
+#  **Example 2:**
+#  
+#  ```
+#  Input: [1, 2, 3, 4]
+#  Output: [1, 4, 2, 3]
+#  ```
+#  
+#  Please sort the array in place and do not define additional arrays.
+
+from typing import (
+    List,
+)
+
+class Solution:
+    """
+    @param nums: A list of integers
+    @return: nothing
+    """
+    def wiggle_sort(self, nums: List[int]):
+        # write your code here
+        n = len(nums)
+        for i in range(1, n):
+            if i & 1:
+                if nums[i] < nums[i - 1]:
+                    nums[i - 1], nums[i] = nums[i], nums[i - 1]
+            else:
+                if nums[i] > nums[i - 1]:
+                    nums[i - 1], nums[i] = nums[i], nums[i - 1]

lintcode/508.wiggle-sort.py

@@ -99,11 +99,11 @@
 80. https://www.lintcode.com/problem/subarray-sum-closest/
 81. https://www.lintcode.com/problem/submatrix-sum/
 82. https://www.lintcode.com/problem/continuous-subarray-sum/
-83. https://www.lintcode.com/problem/maximum-subarray/
+83. https://leetcode.com/problems/maximum-subarray/
 84. https://www.lintcode.com/problem/continuous-subarray-sum-ii/
 85. https://leetcode.com/problems/kth-largest-element-in-an-array/
+86. https://www.lintcode.com/problem/wiggle-sort/
 
-- https://www.lintcode.com/problem/wiggle-sort/
 - https://www.lintcode.com/problem/wiggle-sort-ii/
 - https://www.lintcode.com/problem/nuts-bolts-problem/
 - https://www.lintcode.com/problem/flatten-list/