feat: add solutions to lc problem: No.1196

No.1196.How Many Apples Can You Put into the Basket

Author: yanglbme

README.md

@@ -20,7 +20,7 @@
 
 ## 站点
 
--   Vercel: https://leetcode-doocs.vercel.app
+-   Vercel: https://doocs-leetcode.vercel.app
 -   GitHub Pages: https://doocs.github.io/leetcode
 
 ## 算法全解

README_EN.md

@@ -20,7 +20,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 
 ## Sites
 
--   Vercel: https://leetcode-doocs.vercel.app
+-   Vercel: https://doocs-leetcode.vercel.app
 -   GitHub Pages: https://doocs.github.io/leetcode
 
 ## Solutions

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README.md

@@ -41,22 +41,83 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：排序**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxNumberOfApples(self, weight: List[int]) -> int:
+        weight.sort()
+        ans = 0
+        t = 0
+        for v in weight:
+            if t + v > 5000:
+                break
+            t += v
+            ans += 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int maxNumberOfApples(int[] weight) {
+        Arrays.sort(weight);
+        int ans = 0, t = 0;
+        for (int v : weight) {
+            if (t + v > 5000) {
+                break;
+            }
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxNumberOfApples(vector<int>& weight) {
+        sort(weight.begin(), weight.end());
+        int ans = 0, t = 0;
+        for (int v : weight)
+        {
+            if (t + v > 5000) break;
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxNumberOfApples(weight []int) int {
+	sort.Ints(weight)
+	ans, t := 0, 0
+	for _, v := range weight {
+		if t+v > 5000 {
+			break
+		}
+		t += v
+		ans++
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README_EN.md

@@ -40,13 +40,72 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxNumberOfApples(self, weight: List[int]) -> int:
+        weight.sort()
+        ans = 0
+        t = 0
+        for v in weight:
+            if t + v > 5000:
+                break
+            t += v
+            ans += 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int maxNumberOfApples(int[] weight) {
+        Arrays.sort(weight);
+        int ans = 0, t = 0;
+        for (int v : weight) {
+            if (t + v > 5000) {
+                break;
+            }
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxNumberOfApples(vector<int>& weight) {
+        sort(weight.begin(), weight.end());
+        int ans = 0, t = 0;
+        for (int v : weight)
+        {
+            if (t + v > 5000) break;
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxNumberOfApples(weight []int) int {
+	sort.Ints(weight)
+	ans, t := 0, 0
+	for _, v := range weight {
+		if t+v > 5000 {
+			break
+		}
+		t += v
+		ans++
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int maxNumberOfApples(vector<int>& weight) {
+        sort(weight.begin(), weight.end());
+        int ans = 0, t = 0;
+        for (int v : weight)
+        {
+            if (t + v > 5000) break;
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+};

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/Solution.go

@@ -0,0 +1,12 @@
+func maxNumberOfApples(weight []int) int {
+	sort.Ints(weight)
+	ans, t := 0, 0
+	for _, v := range weight {
+		if t+v > 5000 {
+			break
+		}
+		t += v
+		ans++
+	}
+	return ans
+}

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public int maxNumberOfApples(int[] weight) {
+        Arrays.sort(weight);
+        int ans = 0, t = 0;
+        for (int v : weight) {
+            if (t + v > 5000) {
+                break;
+            }
+            t += v;
+            ++ans;
+        }
+        return ans;
+    }
+}

solution/1100-1199/1196.How Many Apples Can You Put into the Basket/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def maxNumberOfApples(self, weight: List[int]) -> int:
+        weight.sort()
+        ans = 0
+        t = 0
+        for v in weight:
+            if t + v > 5000:
+                break
+            t += v
+            ans += 1
+        return ans