feat: add solutions to lcs problems: No.01,02,03

Author: yanglbme

Diff for: lcs/LCS 01. 下载插件/README.md

@@ -45,22 +45,70 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+如果不能在一分钟内下载完，那么可以先加速，循环直至能在一分钟内下载完。那么“循环次数 + 1”即为最少消耗的分钟数。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def leastMinutes(self, n: int) -> int:
+        speed = res = 1
+        while speed < n:
+            speed <<= 1
+            res += 1
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int leastMinutes(int n) {
+        int speed = 1;
+        int res = 1;
+        while (speed < n) {
+            speed <<= 1;
+            ++res;
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int leastMinutes(int n) {
+        int speed = 1, res = 1;
+        while (speed < n)
+        {
+            speed <<= 1;
+            ++res;
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func leastMinutes(n int) int {
+	speed, res := 1, 1
+	for speed < n {
+		speed <<= 1
+		res++
+	}
+	return res
+}
 ```
 
 ### **...**

Diff for: lcs/LCS 01. 下载插件/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int leastMinutes(int n) {
+        int speed = 1, res = 1;
+        while (speed < n)
+        {
+            speed <<= 1;
+            ++res;
+        }
+        return res;
+    }
+};

Diff for: lcs/LCS 01. 下载插件/Solution.go

@@ -0,0 +1,8 @@
+func leastMinutes(n int) int {
+	speed, res := 1, 1
+	for speed < n {
+		speed <<= 1
+		res++
+	}
+	return res
+}

Diff for: lcs/LCS 01. 下载插件/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int leastMinutes(int n) {
+        int speed = 1;
+        int res = 1;
+        while (speed < n) {
+            speed <<= 1;
+            ++res;
+        }
+        return res;
+    }
+}

Diff for: lcs/LCS 01. 下载插件/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def leastMinutes(self, n: int) -> int:
+        speed = res = 1
+        while speed < n:
+            speed <<= 1
+            res += 1
+        return res

Diff for: lcs/LCS 02. 完成一半题目/README.md

@@ -87,6 +87,50 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int halfQuestions(vector<int>& questions) {
+        vector<int> counter(1010);
+        for (int e : questions) ++counter[e];
+        int n = questions.size() >> 1;
+        sort(counter.begin(), counter.end());
+        int res = 0;
+        for (int i = counter.size() - 1; i >= 0; --i)
+        {
+            ++res;
+            if (counter[i] >= n) return res;
+            n -= counter[i];
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func halfQuestions(questions []int) int {
+	counter := make([]int, 1010)
+	for _, e := range questions {
+		counter[e]++
+	}
+	n := len(questions) >> 1
+	sort.Ints(counter)
+	res := 0
+	for i := len(counter) - 1; i >= 0; i-- {
+		res++
+		if counter[i] >= n {
+			return res
+		}
+		n -= counter[i]
+	}
+	return res
+}
+```
+
 ### **...**
 
 ```

Diff for: lcs/LCS 02. 完成一半题目/Solution.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+    int halfQuestions(vector<int>& questions) {
+        vector<int> counter(1010);
+        for (int e : questions) ++counter[e];
+        int n = questions.size() >> 1;
+        sort(counter.begin(), counter.end());
+        int res = 0;
+        for (int i = counter.size() - 1; i >= 0; --i)
+        {
+            ++res;
+            if (counter[i] >= n) return res;
+            n -= counter[i];
+        }
+        return res;
+    }
+};

Diff for: lcs/LCS 02. 完成一半题目/Solution.go

@@ -0,0 +1,17 @@
+func halfQuestions(questions []int) int {
+	counter := make([]int, 1010)
+	for _, e := range questions {
+		counter[e]++
+	}
+	n := len(questions) >> 1
+	sort.Ints(counter)
+	res := 0
+	for i := len(counter) - 1; i >= 0; i-- {
+		res++
+		if counter[i] >= n {
+			return res
+		}
+		n -= counter[i]
+	}
+	return res
+}

Diff for: lcs/LCS 03. 主题空间/README.md

@@ -185,6 +185,113 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> p;
+    int dirs[4][2] = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
+
+    int largestArea(vector<string>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        p.resize(m * n + 1);
+        for (int i = 0; i < p.size(); ++i) p[i] = i;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (i == 0 || i == m - 1 || j == 0 || j == n - 1 || grid[i][j] == '0') 
+                    p[find(i * n + j)] = find(m * n);
+                else
+                {
+                    for (auto e : dirs)
+                    {
+                        if (grid[i + e[0]][j + e[1]] == '0' || grid[i][j]== grid[i + e[0]][j + e[1]])
+                            p[find(i * n + j)] = find((i + e[0]) * n + j + e[1]);
+                    }
+                }
+            }
+        }
+        unordered_map<int, int> mp;
+        int res = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                int root = find(i * n + j);
+                if (root != find(m * n))
+                {
+                    ++mp[root];
+                    res = max(res, mp[root]);
+                }
+            }
+        }
+        return res;
+    }
+
+    int find(int x) {
+        if (p[x] != x) p[x] = find(p[x]);
+        return p[x];
+    }
+};
+```
+
+### **Go**
+
+```go
+var p []int
+
+func largestArea(grid []string) int {
+	m, n := len(grid), len(grid[0])
+	p = make([]int, m*n+1)
+	for i := 0; i < len(p); i++ {
+		p[i] = i
+	}
+
+	dirs := [4][2]int{{0, -1}, {0, 1}, {1, 0}, {-1, 0}}
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if i == 0 || i == m-1 || j == 0 || j == n-1 || grid[i][j] == '0' {
+				p[find(i*n+j)] = find(m * n)
+			} else {
+				for _, e := range dirs {
+					if grid[i+e[0]][j+e[1]] == '0' || grid[i][j] == grid[i+e[0]][j+e[1]] {
+						p[find(i*n+j)] = find((i+e[0])*n + j + e[1])
+					}
+				}
+			}
+		}
+	}
+	mp := make(map[int]int, 0)
+	res := 0
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			root := find(i*n + j)
+			if root != find(m*n) {
+				mp[root]++
+				res = max(res, mp[root])
+			}
+		}
+	}
+	return res
+}
+
+func find(x int) int {
+	if p[x] != x {
+		p[x] = find(p[x])
+	}
+	return p[x]
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+```
+
 ### **...**
 
 ```

Diff for: lcs/LCS 03. 主题空间/Solution.cpp

@@ -0,0 +1,47 @@
+class Solution {
+public:
+    vector<int> p;
+    int dirs[4][2] = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
+
+    int largestArea(vector<string>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        p.resize(m * n + 1);
+        for (int i = 0; i < p.size(); ++i) p[i] = i;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (i == 0 || i == m - 1 || j == 0 || j == n - 1 || grid[i][j] == '0') 
+                    p[find(i * n + j)] = find(m * n);
+                else
+                {
+                    for (auto e : dirs)
+                    {
+                        if (grid[i + e[0]][j + e[1]] == '0' || grid[i][j]== grid[i + e[0]][j + e[1]])
+                            p[find(i * n + j)] = find((i + e[0]) * n + j + e[1]);
+                    }
+                }
+            }
+        }
+        unordered_map<int, int> mp;
+        int res = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                int root = find(i * n + j);
+                if (root != find(m * n))
+                {
+                    ++mp[root];
+                    res = max(res, mp[root]);
+                }
+            }
+        }
+        return res;
+    }
+
+    int find(int x) {
+        if (p[x] != x) p[x] = find(p[x]);
+        return p[x];
+    }
+};