update

Author: kamyu104

C++/design-compressed-string-iterator.cpp

@@ -0,0 +1,39 @@
+// Time:  O(1)
+// Space: O(1)
+
+class StringIterator {
+public:
+    StringIterator(string compresult_sedString)
+        : result_(compresult_sedString),
+          num_(0),
+          ch_(' ') {
+        
+    }
+    
+    char next() {
+        if (!hasNext()) {
+            return ' ';
+        }
+        if (num_ == 0) {
+            result_ >> ch_ >> num_;
+        }
+        --num_;
+        return ch_;
+    }
+    
+    bool hasNext() {
+        return !result_.eof() || num_ != 0;
+    }
+
+private:
+    istringstream result_;
+    int num_;
+    char ch_;
+};
+
+/**
+ * Your StringIterator object will be instantiated and called as such_:
+ * StringIterator obj = new StringIterator(compresult_sedString);
+ * ch_ar param_1 = obj.next();
+ * bool param_2 = obj.hasNext();
+ */

C++/non-negative-integers-without-consecutive-ones.cpp

@@ -0,0 +1,28 @@
+// Time:  O(1)
+// Space: O(1)
+
+class Solution {
+public:
+    int findIntegers(int num) {
+        vector<int> dp(32);
+        dp[0] = 1;
+        dp[1] = 2;
+        for (int i = 2; i < dp.size(); ++i) {
+            dp[i] = dp[i - 1] + dp[i - 2];
+        }
+        int result = 0, prev_bit = 0;
+        for (int i = 30; i >= 0; --i) {
+            if ((num & (1 << i)) != 0) {
+                result += dp[i];
+                if (prev_bit == 1) {
+                    --result;
+                    break;
+                }
+                prev_bit = 1;
+            } else {
+                prev_bit = 0;
+            }
+        }
+        return result + 1;
+    }
+};