add 22

Author: geemaple

README.md

@@ -45,11 +45,11 @@ 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) | 70/92 | 17 vips |
+| [🔲] | [9c-advanced.md](./list/9c-advanced.md) | 70/91 | 17 vips |
 | [🔲] | [leetcode-contest.md](./list/leetcode-contest.md) | 10/40 | - |
 | [🔲] | [leetcode-google.md](./list/leetcode-google.md) | 0/7 | - |
 
-**Solved**: 442 problems
+**Solved**: 443 problems
 
 ## 类型/Category
 
@@ -155,7 +155,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## Simulation
 
-| Link | Problem(8) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(9) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-67](https://leetcode.com/problems/add-binary/) | Add Binary | [c++](./leetcode/67.add-binary.cpp), [python3](./leetcode/67.add-binary.py) | Simulation | O\(M\+N\) | O\(1\) | - |
 | [Leetcode-415](https://leetcode.com/problems/add-strings/) | Add Strings | [c++](./leetcode/415.add-strings.cpp), [python3](./leetcode/415.add-strings.py) | Simulation | O\(N\) | O\(1\) | - |
@@ -164,6 +164,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [Lintcode-849](https://www.lintcode.com/problem/basic-calculator-iii/) | Basic Calculator III | [c++](./lintcode/849.basic-calculator-iii.cpp), [python3](./lintcode/849.basic-calculator-iii.py) | Simulation | O\(N\) | O\(1\) | Leetcode-772 |
 | [Lintcode-553](https://www.lintcode.com/problem/bomb-enemy/) | Bomb Enemy | [c++](./lintcode/553.bomb-enemy.cpp), [python3](./lintcode/553.bomb-enemy.py) | Simulation | O\(NM\) | O\(NM\) | Leetcode-361 |
 | [Lintcode-366](https://www.lintcode.com/problem/fibonacci/) | Fibonacci | [c++](./lintcode/366.fibonacci.cpp), [python3](./lintcode/366.fibonacci.py) | Simulation | O\(N\) | O\(N\) | - |
+| [Lintcode-22](https://www.lintcode.com/problem/flatten-list/) | Flatten List | [c++](./lintcode/22.flatten-list.cpp), [python3](./lintcode/22.flatten-list.py) | Simulation | O\(N\) | O\(N\) | - |
 | [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) | Simulation | O\(N\) | O\(1\) | - |
 
 ## Design

lintcode/22.flatten-list.cpp

@@ -0,0 +1,124 @@
+//  Tag: Simulation
+//  Time: O(N)
+//  Space: O(N)
+//  Ref: -
+//  Note: -
+
+//  Given a list, each element in the list can be a list or an integer.Flatten it into a simply list with integers.
+//  
+//  **Example 1:**  
+//   
+//  Input:  
+//  ``` 
+//  list = [[1,1],2,[1,1]]
+//  ``` 
+//  Output:  
+//  ``` 
+//  [1,1,2,1,1]
+//  ``` 
+//  Explanation:  
+//  
+//  Flatten it into a simply list with integers.
+//  
+//  **Example 2:**  
+//   
+//  Input:  
+//  ``` 
+//  list = [1,2,[1,2]]
+//  ``` 
+//  Output:  
+//  ``` 
+//  [1,2,1,2]
+//  ``` 
+//  Explanation:  
+//  
+//  Flatten it into a simply list with integers.
+//  
+//  **Example 3:**  
+//   
+//  Input:  
+//  ``` 
+//  list = [4,[3,[2,[1]]]]
+//  ``` 
+//  Output:  
+//  ``` 
+//  [4,3,2,1]
+//  ``` 
+//  Explanation:  
+//  
+//  Flatten it into a simply list with integers.
+//  
+//  If the element in the given list is a list, it can contain list too.
+
+/**
+ * // This is the interface that allows for creating nested lists.
+ * // You should not implement it, or speculate about its implementation
+ * class NestedInteger {
+ *   public:
+ *     // Return true if this NestedInteger holds a single integer,
+ *     // rather than a nested list.
+ *     bool isInteger() const;
+ *
+ *     // Return the single integer that this NestedInteger holds,
+ *     // if it holds a single integer
+ *     // The result is undefined if this NestedInteger holds a nested list
+ *     int getInteger() const;
+ *
+ *     // Return the nested list that this NestedInteger holds,
+ *     // if it holds a nested list
+ *     // The result is undefined if this NestedInteger holds a single integer
+ *     const vector<NestedInteger> &getList() const;
+ * };
+ */
+class Solution {
+public:
+    // @param nestedList a list of NestedInteger
+    // @return a list of integer
+    vector<int> flatten(vector<NestedInteger> &nestedList) {
+        // Write your code here
+        vector<int> res;
+        flatten(nestedList, res);
+        return res;
+    }
+
+    void flatten(const vector<NestedInteger> &nestedList, vector<int>& result) {
+        for (auto x : nestedList) {
+            if (x.isInteger()) {
+                result.push_back(x.getInteger());
+            } else {
+                flatten(x.getList(), result);
+            }
+        }
+    }
+};
+
+class Solution {
+public:
+    // @param nestedList a list of NestedInteger
+    // @return a list of integer
+    vector<int> flatten(vector<NestedInteger> &nestedList) {
+        // Write your code here
+        vector<int> result;
+        stack<NestedInteger> stack;
+
+        for (int i = nestedList.size() - 1; i >= 0; i--) {
+            stack.push(nestedList[i]);
+        }
+
+        while (!stack.empty()) {
+            NestedInteger cur = stack.top();
+            stack.pop();
+
+            if (cur.isInteger()) {
+                result.push_back(cur.getInteger());
+            } else {
+                auto &list = cur.getList();
+                for (int i = list.size() - 1; i >= 0; i--) {
+                    stack.push(list[i]);
+                }
+            }
+        }
+
+        return result;
+    }
+};

lintcode/22.flatten-list.py

@@ -0,0 +1,88 @@
+#  Tag: Simulation
+#  Time: O(N)
+#  Space: O(N)
+#  Ref: -
+#  Note: -
+
+#  Given a list, each element in the list can be a list or an integer.Flatten it into a simply list with integers.
+#  
+#  **Example 1:**  
+#   
+#  Input:  
+#  ``` 
+#  list = [[1,1],2,[1,1]]
+#  ``` 
+#  Output:  
+#  ``` 
+#  [1,1,2,1,1]
+#  ``` 
+#  Explanation:  
+#  
+#  Flatten it into a simply list with integers.
+#  
+#  **Example 2:**  
+#   
+#  Input:  
+#  ``` 
+#  list = [1,2,[1,2]]
+#  ``` 
+#  Output:  
+#  ``` 
+#  [1,2,1,2]
+#  ``` 
+#  Explanation:  
+#  
+#  Flatten it into a simply list with integers.
+#  
+#  **Example 3:**  
+#   
+#  Input:  
+#  ``` 
+#  list = [4,[3,[2,[1]]]]
+#  ``` 
+#  Output:  
+#  ``` 
+#  [4,3,2,1]
+#  ``` 
+#  Explanation:  
+#  
+#  Flatten it into a simply list with integers.
+#  
+#  If the element in the given list is a list, it can contain list too.
+
+from collections import deque
+class Solution(object):
+
+    # @param nestedList a list, each element in the list 
+    # can be a list or integer, for example [1,2,[1,2]]
+    # @return {int[]} a list of integer
+    def flatten(self, nestedList):
+        # Write your code here
+        res = []
+        for x in nestedList:
+            if isinstance(x, list):
+                res += self.flatten(x)
+            else:
+                res.append(x)
+
+        return res
+    
+class Solution(object):
+    # @param nestedList a list, each element in the list 
+    # can be a list or integer, for example [1,2,[1,2]]
+    # @return {int[]} a list of integer
+    def flatten(self, nestedList):
+        # Write your code here
+        res = []
+        stack = []
+        for x in reversed(nestedList):
+            stack.append(x)
+
+        while len(stack) > 0:
+            cur = stack.pop()
+            if isinstance(cur, int):
+                res.append(cur)
+            else:
+                stack.extend(reversed(cur))
+
+        return res

list/9c-advanced.md

@@ -105,7 +105,6 @@
 86. https://www.lintcode.com/problem/wiggle-sort/
 87. https://leetcode.com/problems/wiggle-sort-ii/
 
-- https://www.lintcode.com/problem/nuts-bolts-problem/
 - https://www.lintcode.com/problem/flatten-list/
 - https://www.lintcode.com/problem/flatten-nested-list-iterator/
 - https://www.lintcode.com/problem/flatten-2d-vector/