add 158

Author: geemaple

README.md

@@ -51,7 +51,7 @@ 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) | 12/52 | 1 vip |
+| [🔲] | [9c-top.md](./list/9c-top.md) | 13/52 | 1 vip |
 
 **Solved**: 481 problems
 
@@ -185,7 +185,7 @@ python problem.py https://www.lintcode.com/problem/92 -l cpp
 | [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-640](https://www.lintcode.com/problem/one-edit-distance/) | One Edit Distance | [c++](./lintcode/640.one-edit-distance.cpp), [python3](./lintcode/640.one-edit-distance.py) | Simulation | O\(N\) | O\(1\) | Leetcode-161 |
 | [Lintcode-3622](https://www.lintcode.com/problem/read-n-characters-given-read4/) | Read N Characters Given Read4 | [c++](./lintcode/3622.read-n-characters-given-read4.cpp), [python3](./lintcode/3622.read-n-characters-given-read4.py) | Simulation | O\(N\) | O\(1\) | Leetcode-157 |
-| [Lintcode-660](https://www.lintcode.com/problem/read-n-characters-given-read4-ii-call-multiple-times/) | Read N Characters Given Read4 Ii Call Multiple Times | [c++](./lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.cpp), [python3](./lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.py) | Simulation | \- | \- | - |
+| [Lintcode-660](https://www.lintcode.com/problem/read-n-characters-given-read4-ii-call-multiple-times/) | Read N Characters Given Read4 Ii Call Multiple Times | [c++](./lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.cpp), [python3](./lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.py) | Simulation | O\(N\) | O\(1\) | Leetcode-158 |
 | [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\) | - |
 | [Lintcode-644](https://www.lintcode.com/problem/strobogrammatic-number/) | Strobogrammatic Number | [c++](./lintcode/644.strobogrammatic-number.cpp), [python3](./lintcode/644.strobogrammatic-number.py) | Simulation | O\(N\) | O\(1\) | Leetcode-246 |
 | [Lintcode-637](https://www.lintcode.com/problem/valid-word-abbreviation/) | Valid Word Abbreviation | [c++](./lintcode/637.valid-word-abbreviation.cpp), [python3](./lintcode/637.valid-word-abbreviation.py) | Simulation | O\(N\) | O\(1\) | Leetcode-408 |

lintcode/3622.read-n-characters-given-read4.cpp

@@ -110,15 +110,15 @@ class Solution {
         // write you code here
         char tmp[4];
         int offset = 0;
-        int read = 0;
+        int count = 0;
 
         for(auto i = 0; i < n; ++i) {
-            if (offset == read) {
-                read = read4(tmp);
+            if (offset == count) {
+                count = read4(tmp);
                 offset = 0;
             }
 
-            if (offset < read) {
+            if (offset < count) {
                 buf[i] = tmp[offset++];
             } else {
                 return i;

lintcode/3622.read-n-characters-given-read4.py

@@ -105,14 +105,14 @@ def read(self, buf: List[str], n: int) -> int:
         # write you code here
         tmp = [''] * 4
         offset = 0
-        read = 0
+        count = 0
 
         for i in range(n):
-            if offset == read:
-                read = self.read4(tmp)
+            if offset == count:
+                count = self.read4(tmp)
                 offset = 0
 
-            if offset < read:
+            if offset < count:
                 buf[i] = tmp[offset]
                 offset += 1
             else:

lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.cpp

@@ -0,0 +1,80 @@
+//  Tag: String, Simulation
+//  Time: O(N)
+//  Space: O(1)
+//  Ref: Leetcode-158
+//  Note: -
+
+//  The API: `int read4(char *buf)` reads `4` characters at a time from a file.
+//  
+//  The return value is the actual number of characters read.
+//  For example, it returns 3 if there is only 3 characters left in the file.
+//  
+//  By using the read4 API, implement the function `int read(char *buf, int n)` that reads n characters from the file.
+//  
+//  **Example 1**
+//  
+//  ```plain
+//  Input:
+//  "filetestbuffer"
+//  read(6)
+//  read(5)
+//  read(4)
+//  read(3)
+//  read(2)
+//  read(1)
+//  read(10)
+//  Output:
+//  6, buf = "filete"
+//  5, buf = "stbuf"
+//  3, buf = "fer"
+//  0, buf = ""
+//  0, buf = ""
+//  0, buf = ""
+//  0, buf = ""
+//  ```
+//  
+//  **Example 2**
+//  
+//  ```plain
+//  Input:
+//  "abcdef"
+//  read(1)
+//  read(5)
+//  Output:
+//  1, buf = "a"
+//  5, buf = "bcdef"
+//  ```
+//  
+//  The `read` function may be called multiple times.
+
+// Forward declaration of the read4 API.
+int read4(char *buf);
+
+class Solution {
+public:
+    /**
+     * @param buf destination buffer
+     * @param n maximum number of characters to read
+     * @return the number of characters read
+     */
+    int count = 0;
+    int offset = 0;
+    char tmp[4];
+    int read(char *buf, int n) {
+        // Write your code here
+        int length = 0;
+        while (length < n) {
+            if (count == offset) {
+                count = read4(tmp);
+                offset = 0;
+            }
+
+            if (offset < count) {
+                buf[length++] = tmp[offset++];
+            } else {
+                break;
+            }
+        }
+        return length;
+    }
+};

lintcode/660.read-n-characters-given-read4-ii-call-multiple-times.py

@@ -0,0 +1,81 @@
+#  Tag: String, Simulation
+#  Time: O(N)
+#  Space: O(1)
+#  Ref: Leetcode-158
+#  Note: -
+
+#  The API: `int read4(char *buf)` reads `4` characters at a time from a file.
+#  
+#  The return value is the actual number of characters read.
+#  For example, it returns 3 if there is only 3 characters left in the file.
+#  
+#  By using the read4 API, implement the function `int read(char *buf, int n)` that reads n characters from the file.
+#  
+#  **Example 1**
+#  
+#  ```plain
+#  Input:
+#  "filetestbuffer"
+#  read(6)
+#  read(5)
+#  read(4)
+#  read(3)
+#  read(2)
+#  read(1)
+#  read(10)
+#  Output:
+#  6, buf = "filete"
+#  5, buf = "stbuf"
+#  3, buf = "fer"
+#  0, buf = ""
+#  0, buf = ""
+#  0, buf = ""
+#  0, buf = ""
+#  ```
+#  
+#  **Example 2**
+#  
+#  ```plain
+#  Input:
+#  "abcdef"
+#  read(1)
+#  read(5)
+#  Output:
+#  1, buf = "a"
+#  5, buf = "bcdef"
+#  ```
+#  
+#  The `read` function may be called multiple times.
+
+"""
+The read4 API is already defined for you.
+@param buf a list of characters
+@return an integer
+you can call Reader.read4(buf)
+"""
+
+
+class Solution:
+
+    # @param {char[]} buf destination buffer
+    # @param {int} n maximum number of characters to read
+    # @return {int} the number of characters read
+    def __init__(self):
+        self.offset = 0
+        self.count = 0
+        self.tmp = [''] * 4
+
+    def read(self, buf, n):
+        # Write your code here
+        for i in range(n):
+            if self.offset == self.count:
+                self.count = Reader.read4(self.tmp)
+                self.offset = 0
+
+            if self.offset < self.count:
+                buf[i] = self.tmp[self.offset]
+                self.offset += 1
+            else:
+                return i
+
+        return n

list/9c-top.md

@@ -18,8 +18,8 @@
 11. https://www.lintcode.com/problem/strobogrammatic-number/
 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/
 
-- https://www.lintcode.com/problem/read-characters-from-file-multiple-calls/
 - https://www.lintcode.com/problem/strings-serialization/
 - https://www.lintcode.com/problem/binary-tree-serialization/
 - https://www.lintcode.com/problem/system-longest-file-path/