add code

Author: ncdhz

.gitignore

@@ -1,6 +1,7 @@
 .vscode
 *.class
 __pycache__
+.test
 # Logs
 logs
 *.log

code/173.二叉搜索树迭代器.cpp

@@ -3,7 +3,8 @@
  *
  * [173] 二叉搜索树迭代器
  */
-
+#include <list>
+using namespace std;
 // @lc code=start
 /**
  * Definition for a binary tree node.
@@ -18,16 +19,31 @@
  */
 class BSTIterator {
 public:
+    list<TreeNode*> nodes;
+    int i = 0;
     BSTIterator(TreeNode* root) {
+        nodes.clear();
+        md(root);
+    }
 
+    void md(TreeNode* root) {
+        while (root != nullptr) {
+            nodes.push_back(root);
+            root = root->left;
+        }
     }
 
     int next() {
-
+        TreeNode* node = nodes.back();
+        nodes.pop_back();
+        if (node->right != nullptr) {
+            md(node->right);
+        }
+        return node->val;
     }
 
     bool hasNext() {
-
+        return nodes.size() > 0;
     }
 };
 

code/179.最大数.cpp

@@ -0,0 +1,38 @@
+/*
+ * @lc app=leetcode.cn id=179 lang=cpp
+ *
+ * [179] 最大数
+ */
+#include <string>
+#include <algorithm>
+#include <sstream>
+#include <vector>
+using namespace std;
+
+// @lc code=start
+class Solution {
+public:
+    string largestNumber(vector<int>& nums) {
+        sort(nums.begin(), nums.end(), [](int x, int y) {
+            long sx = 10;
+            long sy = 10;
+            while (sx <= x) {
+                sx *= 10;
+            }
+            while (sy <= y) {
+                sy *= 10;
+            }
+            return sy * x + y > sx * y + x;
+        });
+        if (nums[0] == 0) {
+            return "0";
+        }
+        stringstream ss;
+        for (int num: nums) {
+            ss << to_string(num);
+        }
+        return ss.str();
+    }
+};
+// @lc code=end
+

code/85.最大矩形.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=85 lang=cpp
+ *
+ * [85] 最大矩形
+ */
+
+// @lc code=start
+class Solution {
+public:
+    int maximalRectangle(vector<vector<char>>& matrix) {
+
+    }
+};
+// @lc code=end
+