feat: add solutions to lc problem: No. 1833.Maximum Ice Cream Bars

Author: maolonglong

solution/1800-1899/1833.Maximum Ice Cream Bars/README.md

@@ -53,22 +53,59 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+注意数据范围，题目很容易误导我们使用01背包（会超时），其实这题就是简单贪心，优先选择定价小的雪糕。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxIceCream(self, costs: List[int], coins: int) -> int:
+        costs.sort()
+        ans, n = 0, len(costs)
+        for i in range(n):
+            if coins < costs[i]:
+                break
+            else:
+                ans += 1
+                coins -= costs[i]
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int maxIceCream(int[] costs, int coins) {
+        Arrays.sort(costs);
+        int ans = 0, n = costs.length;
+        for (int i = 0; i < n && coins >= costs[i]; i++) {
+            ans++;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+}
+```
 
+### **Go**
+
+```go
+func maxIceCream(costs []int, coins int) int {
+	sort.Ints(costs)
+	n := len(costs)
+	ans := 0
+	for i := 0; i < n && coins >= costs[i]; i++ {
+		ans++
+		coins -= costs[i]
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1800-1899/1833.Maximum Ice Cream Bars/README_EN.md

@@ -50,18 +50,55 @@
 
 ## Solutions
 
+Pay attention to the data range. The question can easily mislead us to use the 01 backpack (it will overtime). In fact, this question is a simple "greedy problem" (choose low-priced ice cream first)
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxIceCream(self, costs: List[int], coins: int) -> int:
+        costs.sort()
+        ans, n = 0, len(costs)
+        for i in range(n):
+            if coins < costs[i]:
+                break
+            else:
+                ans += 1
+                coins -= costs[i]
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int maxIceCream(int[] costs, int coins) {
+        Arrays.sort(costs);
+        int ans = 0, n = costs.length;
+        for (int i = 0; i < n && coins >= costs[i]; i++) {
+            ans++;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+}
+```
 
+### **Go**
+
+```go
+func maxIceCream(costs []int, coins int) int {
+	sort.Ints(costs)
+	n := len(costs)
+	ans := 0
+	for i := 0; i < n && coins >= costs[i]; i++ {
+		ans++
+		coins -= costs[i]
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.go

@@ -0,0 +1,10 @@
+func maxIceCream(costs []int, coins int) int {
+	sort.Ints(costs)
+	n := len(costs)
+	ans := 0
+	for i := 0; i < n && coins >= costs[i]; i++ {
+		ans++
+		coins -= costs[i]
+	}
+	return ans
+}

solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int maxIceCream(int[] costs, int coins) {
+        Arrays.sort(costs);
+        int ans = 0, n = costs.length;
+        for (int i = 0; i < n && coins >= costs[i]; i++) {
+            ans++;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+}

solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def maxIceCream(self, costs: List[int], coins: int) -> int:
+        costs.sort()
+        ans, n = 0, len(costs)
+        for i in range(n):
+            if coins < costs[i]:
+                break
+            else:
+                ans += 1
+                coins -= costs[i]
+        return ans