add 659

Author: geemaple

README.md

@@ -51,9 +51,9 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [✅] | [leetcode-top-100-liked.md](./list/leetcode-top-100-liked.md) | 100/100 | - |
 | [✅] | [leetcode101.md](./list/leetcode101.md) | 183/184 | 1 vip |
 | [🔲] | [9c-basic.md](./list/9c-basic.md) | 14/129 | 3 vips |
-| [🔲] | [9c-top.md](./list/9c-top.md) | 13/52 | 1 vip |
+| [🔲] | [9c-top.md](./list/9c-top.md) | 14/52 | 1 vip |
 
-**Solved**: 481 problems
+**Solved**: 482 problems
 
 ## 类型/Category
 
@@ -910,10 +910,11 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 
 ## String
 
-| Link | Problem(3) | Solution | Tag | Time | Space | Ref |
+| Link | Problem(4) | Solution | Tag | Time | Space | Ref |
 | ----- | ----- | ----- | ----- | ----- | ----- | ----- |
 | [Leetcode-3340](https://leetcode.com/problems/check-balanced-string/) | Check Balanced String | [c++](./leetcode/3340.check-balanced-string.cpp), [python3](./leetcode/3340.check-balanced-string.py) | String | O\(N\) | O\(1\) | - |
 | [Leetcode-796](https://leetcode.com/problems/rotate-string/) | Rotate String | [c++](./leetcode/796.rotate-string.cpp), [python3](./leetcode/796.rotate-string.py) | String | O\(N\) | O\(N\) | - |
+| [Lintcode-659](https://www.lintcode.com/problem/encode-and-decode-strings/) | Encode And Decode Strings | [c++](./lintcode/659.encode-and-decode-strings.cpp), [python3](./lintcode/659.encode-and-decode-strings.py) | String | O\(N\) | O\(1\) | Leetcode-271 |
 | [Lintcode-1790](https://www.lintcode.com/problem/rotate-string-ii/) | Rotate String II | [c++](./lintcode/1790.rotate-string-ii.cpp), [python3](./lintcode/1790.rotate-string-ii.py) | String | O\(N\) | O\(N\) | - |
 
 ## Other

lintcode/659.encode-and-decode-strings.cpp

@@ -0,0 +1,80 @@
+//  Tag: String
+//  Time: O(N)
+//  Space: O(1)
+//  Ref: Leetcode-271
+//  Note: -
+
+//  Design an algorithm to encode a list of strings to a string.
+//  The encoded string is then sent over the network and is decoded back to the original list of strings.
+//  
+//  Please implement `encode` and `decode`
+//  
+//  **Example1**
+//  ```
+//  Input: ["lint","code","love","you"]
+//  Output: ["lint","code","love","you"]
+//  Explanation:
+//  One possible encode method is: "lint:;code:;love:;you"
+//  ```
+//  **Example2**
+//  ```
+//  Input: ["we", "say", ":", "yes"]
+//  Output: ["we", "say", ":", "yes"]
+//  Explanation:
+//  One possible encode method is: "we:;say:;:::;yes"
+//  ```
+//  
+//  Because the string may contain any of the **256** legal ASCII characters, your algorithm must be able to handle any character that may appear
+//  
+//  Do not rely on any libraries, the purpose of this problem is to implement the "encode" and "decode" algorithms on your own
+
+class Solution {
+public:
+    /*
+     * @param strs: a list of strings
+     * @return: encodes a list of strings to a single string.
+     */
+    string encode(vector<string> &strs) {
+        // write your code here
+        string res;
+        for (string &str: strs) {
+            for (char c: str) {
+                if (c == ':') {
+                    res += "::";
+                } else {
+                    res += c;
+                }
+            }
+            res += ":;";
+        }
+        return res;
+    }
+
+    /*
+     * @param str: A string
+     * @return: decodes a single string to a list of strings
+     */
+    vector<string> decode(string &str) {
+        // write your code here
+        vector<string> res;
+        string word;
+        int i = 0;
+        while (i < str.size()) {
+            if (str[i] == ':') {
+                if (str[i + 1] == ':') {
+                    word += ':';
+                } else {
+                    res.push_back(word);
+                    word = "";
+                }
+                i += 2;
+            } else {
+                word += str[i];
+                i += 1;
+            }
+
+
+        }
+        return res;
+    }
+};

lintcode/659.encode-and-decode-strings.py

@@ -0,0 +1,64 @@
+#  Tag: String
+#  Time: O(N)
+#  Space: O(1)
+#  Ref: Leetcode-271
+#  Note: -
+
+#  Design an algorithm to encode a list of strings to a string.
+#  The encoded string is then sent over the network and is decoded back to the original list of strings.
+#  
+#  Please implement `encode` and `decode`
+#  
+#  **Example1**
+#  ```
+#  Input: ["lint","code","love","you"]
+#  Output: ["lint","code","love","you"]
+#  Explanation:
+#  One possible encode method is: "lint:;code:;love:;you"
+#  ```
+#  **Example2**
+#  ```
+#  Input: ["we", "say", ":", "yes"]
+#  Output: ["we", "say", ":", "yes"]
+#  Explanation:
+#  One possible encode method is: "we:;say:;:::;yes"
+#  ```
+#  
+#  Because the string may contain any of the **256** legal ASCII characters, your algorithm must be able to handle any character that may appear
+#  
+#  Do not rely on any libraries, the purpose of this problem is to implement the "encode" and "decode" algorithms on your own
+
+class Solution:
+    """
+    @param: strs: a list of strings
+    @return: encodes a list of strings to a single string.
+    """
+    def encode(self, strs):
+        # write your code here
+        res = ''
+        for s in strs:
+            res += s.replace(':', '::') + ':;'
+        return res
+
+    """
+    @param: str: A string
+    @return: decodes a single string to a list of strings
+    """
+    def decode(self, str):
+        # write your code here
+        res = []
+        word = ''
+        i = 0
+        while i < len(str):
+            if str[i] == ':':
+                if str[i + 1] == ':':
+                    word += ':'
+                else:
+                    res.append(word)
+                    word = ''
+                i += 2
+            else:
+                word += str[i]
+                i += 1
+
+        return res

list/9c-top.md

@@ -19,8 +19,8 @@
 12. https://www.lintcode.com/problem/one-edit-distance/
 13. https://www.lintcode.com/problem/read-n-characters-given-read4/
 14. https://www.lintcode.com/problem/read-n-characters-given-read4-ii-call-multiple-times/
+15. https://www.lintcode.com/problem/encode-and-decode-strings/
 
-- https://www.lintcode.com/problem/strings-serialization/
 - https://www.lintcode.com/problem/binary-tree-serialization/
 - https://www.lintcode.com/problem/system-longest-file-path/
 - https://www.lintcode.com/problem/roman-to-integer/