feat: add solutions to lc problem: No.1431. Kids With the Greatest

Number of Candies

Author: yanglbme

solution/0000-0099/0064.Minimum Path Sum/README.md

@@ -42,7 +42,7 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-动态规划。假设 `dp[i][j]` 表示到达网格 `(i,j)` 的最小数字和，先初始化 dp 第一列和第一行的所有值，然后利用递推公式：`dp[i][j] = min(dp[i -1][j], dp[i][j - 1]) + grid[i][j]` 求得 dp。
+动态规划。假设 `dp[i][j]` 表示到达网格 `(i,j)` 的最小数字和，先初始化 dp 第一列和第一行的所有值，然后利用递推公式：`dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j]` 求得 dp。
 
 最后返回 `dp[m - 1][n - 1]` 即可。
 

solution/1400-1499/1431.Kids With the Greatest Number of Candies/README.md

@@ -47,7 +47,6 @@
 	<li><code>1 &lt;= extraCandies &lt;= 50</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -59,15 +58,69 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
+        mx = max(candies)
+        return [candy + extraCandies >= mx for candy in candies]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
+        int mx = 0;
+        for (int candy : candies) {
+            mx = Math.max(mx, candy);
+        }
+        List<Boolean> res = new ArrayList<>();
+        for (int candy : candies) {
+            res.add(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+        int mx = *max_element(candies.begin(), candies.end());
+        vector<bool> res;
+        for (int candy : candies) {
+            res.push_back(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func kidsWithCandies(candies []int, extraCandies int) []bool {
+	mx := 0
+	for _, candy := range candies {
+		mx = max(mx, candy)
+	}
+	var res []bool
+	for _, candy := range candies {
+		res = append(res, candy+extraCandies >= mx)
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1400-1499/1431.Kids With the Greatest Number of Candies/README_EN.md

@@ -6,18 +6,12 @@
 
 <p>Given the array <code>candies</code> and the integer <code>extraCandies</code>, where <code>candies[i]</code> represents the number of candies that the <strong><em>ith</em></strong> kid has.</p>
 
-
-
 <p>For each kid check if there is a way to distribute <code>extraCandies</code> among the kids such that he or she can have the <strong>greatest</strong> number of candies among them.&nbsp;Notice that multiple kids can have the <strong>greatest</strong> number of candies.</p>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> candies = [2,3,5,1,3], extraCandies = 3
@@ -38,12 +32,8 @@ Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> candies = [4,2,1,1,2], extraCandies = 1
@@ -54,12 +44,8 @@ Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have
 
 </pre>
 
-
-
 <p><strong>Example 3:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> candies = [12,1,12], extraCandies = 10
@@ -68,14 +54,10 @@ Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have
 
 </pre>
 
-
-
 <p>&nbsp;</p>
 
 <p><strong>Constraints:</strong></p>
 
-
-
 <ul>
 	<li><code>2 &lt;= candies.length &lt;= 100</code></li>
 	<li><code>1 &lt;= candies[i] &lt;= 100</code></li>
@@ -89,13 +71,67 @@ Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have
 ### **Python3**
 
 ```python
-
+class Solution:
+    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
+        mx = max(candies)
+        return [candy + extraCandies >= mx for candy in candies]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
+        int mx = 0;
+        for (int candy : candies) {
+            mx = Math.max(mx, candy);
+        }
+        List<Boolean> res = new ArrayList<>();
+        for (int candy : candies) {
+            res.add(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+        int mx = *max_element(candies.begin(), candies.end());
+        vector<bool> res;
+        for (int candy : candies) {
+            res.push_back(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func kidsWithCandies(candies []int, extraCandies int) []bool {
+	mx := 0
+	for _, candy := range candies {
+		mx = max(mx, candy)
+	}
+	var res []bool
+	for _, candy := range candies {
+		res = append(res, candy+extraCandies >= mx)
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+        int mx = *max_element(candies.begin(), candies.end());
+        vector<bool> res;
+        for (int candy : candies) {
+            res.push_back(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+};

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.go

@@ -0,0 +1,18 @@
+func kidsWithCandies(candies []int, extraCandies int) []bool {
+	mx := 0
+	for _, candy := range candies {
+		mx = max(mx, candy)
+	}
+	var res []bool
+	for _, candy := range candies {
+		res = append(res, candy+extraCandies >= mx)
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+        int mx = *max_element(candies.begin(), candies.end());
+        vector<bool> res;
+        for (int candy : candies) {
+            res.push_back(candy + extraCandies >= mx);
+        }
+        return res;
+    }
+};

solution/1400-1499/1431.Kids With the Greatest Number of Candies/Solution.py

@@ -0,0 +1,4 @@
+class Solution:
+    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
+        mx = max(candies)
+        return [candy + extraCandies >= mx for candy in candies]