add code

Author: ncdhz

Makefile

@@ -8,7 +8,12 @@ dev:
 	cd web && npm run dev
 
 build:
+	make code2db
 	cd web && npm run build
 
 build-only:
-	cd web && npm run build-only
+	make code2db
+	cd web && npm run build-only
+
+rm:
+	rm -rf docs/assets && rm -rf docs/index.html && rm -rf  docs/logo.png

code/284.顶端迭代器.cpp

@@ -0,0 +1,63 @@
+/*
+ * @lc app=leetcode.cn id=284 lang=cpp
+ *
+ * [284] 顶端迭代器
+ */
+
+// @lc code=start
+/*
+ * Below is the interface for Iterator, which is already defined for you.
+ * **DO NOT** modify the interface for Iterator.
+ *
+ *  class Iterator {
+ *		struct Data;
+ * 		Data* data;
+ *  public:
+ *		Iterator(const vector<int>& nums);
+ * 		Iterator(const Iterator& iter);
+ *
+ * 		// Returns the next element in the iteration.
+ *		int next();
+ *
+ *		// Returns true if the iteration has more elements.
+ *		bool hasNext() const;
+ *	};
+ */
+
+class PeekingIterator : public Iterator {
+private:
+	bool isHas = false;
+	int nextData;
+public:
+	PeekingIterator(const vector<int>& nums) : Iterator(nums) {
+	    // Initialize any member here.
+	    // **DO NOT** save a copy of nums and manipulate it directly.
+	    // You should only use the Iterator interface methods.
+		isHas = Iterator::hasNext();
+	    if (isHas) {
+			nextData = Iterator::next();
+		}
+	}
+	
+    // Returns the next element in the iteration without advancing the iterator.
+	int peek() {
+        return nextData;
+	}
+	
+	// hasNext() and next() should behave the same as in the Iterator interface.
+	// Override them if needed.
+	int next() {
+		isHas = Iterator::hasNext();
+		int d = nextData;
+		if (isHas) {
+			nextData = Iterator::next();
+		}
+	    return d;
+	}
+	
+	bool hasNext() const {
+	    return isHas;
+	}
+};
+// @lc code=end
+

code/287.寻找重复数.cpp

@@ -0,0 +1,26 @@
+/*
+ * @lc app=leetcode.cn id=287 lang=cpp
+ *
+ * [287] 寻找重复数
+ */
+
+// @lc code=start
+class Solution {
+public:
+    int findDuplicate(vector<int>& nums) {
+        int low = 0;
+        int fast = 0;
+        do {
+            low = nums[low];
+            fast = nums[nums[fast]];
+        } while (low != fast);
+        low = 0;
+        while (low != fast) {
+            low = nums[low];
+            fast = nums[fast];
+        }
+        return low;
+    }
+};
+// @lc code=end
+