leetcode_biweek_26

Author: OneCodeMonkey

contest/leetcode_biweek_26/[editing]leetcode_5398_Count_Good_Nodes_in_Binary_Tree.cpp

@@ -0,0 +1,17 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int goodNodes(TreeNode* root) {
+     	
+    }
+};

contest/leetcode_biweek_26/[editing]leetcode_5399_Form_Largest_Integer_With_Digits_That_Add_up_to_Target.cpp

@@ -0,0 +1,6 @@
+class Solution {
+public:
+    string largestNumber(vector<int>& cost, int target) {
+        
+    }
+};

contest/leetcode_biweek_26/leetcode_5396_Consecutive_Characters.cpp

@@ -0,0 +1,29 @@
+/**
+ * AC
+ *
+ */
+class Solution {
+public:
+    int maxPower(string s) {
+		int ret = 1;
+		int nowLength = 1;
+		int size = s.length();
+		char nowChar = s[0];
+
+		for (int i = 1; i < size; i++) {
+			if (s[i] == nowChar) {
+				nowLength++;
+				if (nowLength > ret) {
+					ret = nowLength;
+				}
+			}
+			else {
+				nowLength = 1;
+				nowChar = s[i];
+			}
+		}
+
+		return ret;
+
+	}
+};

contest/leetcode_biweek_26/leetcode_5397_Simplified_Fractions.cpp

@@ -0,0 +1,42 @@
+/**
+ * AC
+ *
+ */
+class Solution {
+public:
+    vector<string> simplifiedFractions(int n) {
+		vector<string> ret;
+		if (n == 1) {
+			return ret;
+		}
+
+		// 用 set 对结果去重
+		set<string> record;
+
+		for (int i = 2; i <= n; i++) {
+			// 求出分母为 i 下的所有最简真分数，添加进 set
+			int num1, num2, temp;
+			for (int j = 1; j < i; j++) {
+				num1 = i;
+				num2 = j;
+
+				while (num2 != 0) {
+					temp = num1 % num2;
+					num1 = num2;
+					num2 = temp;
+				}
+				if (num1 == 1) {
+					string result = to_string(j) + "/" + to_string(i);
+					record.insert(result);
+				}
+			}
+		}
+
+		set<string>::iterator it;
+		for(it = record.begin(); it != record.end(); it++) {
+			ret.push_back(*it);
+		}
+
+		return ret;
+	}
+};