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

yanglbme · yanglbme · commit fbc0988f2292 · 2021-09-27T20:57:15.000+08:00
diff --git a/solution/1800-1899/1833.Maximum Ice Cream Bars/README.md b/solution/1800-1899/1833.Maximum Ice Cream Bars/README.md
@@ -48,12 +48,11 @@
 	<li><code>1 &lt;= coins &lt;= 10<sup>8</sup></code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
-注意数据范围，题目很容易误导我们使用01背包（会超时），其实这题就是简单贪心，优先选择定价小的雪糕。
+注意数据范围，题目很容易误导我们使用 01 背包（会超时），其实这题就是简单贪心，优先选择定价小的雪糕。
 
 <!-- tabs:start -->
 
@@ -65,13 +64,13 @@
 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]:
+        ans = 0
+        for c in costs:
+            if coins < c:
                 break
             else:
                 ans += 1
-                coins -= costs[i]
+                coins -= c
         return ans
 ```
 
@@ -93,6 +92,24 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxIceCream(vector<int>& costs, int coins) {
+        sort(costs.begin(), costs.end());
+        int ans = 0;
+        for (int i = 0; i < costs.size() && coins >= costs[i]; ++i)
+        {
+            ++ans;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
diff --git a/solution/1800-1899/1833.Maximum Ice Cream Bars/README_EN.md b/solution/1800-1899/1833.Maximum Ice Cream Bars/README_EN.md
@@ -47,7 +47,6 @@
 	<li><code>1 &lt;= coins &lt;= 10<sup>8</sup></code></li>
 </ul>
 
-
 ## 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)
@@ -60,13 +59,13 @@ Pay attention to the data range. The question can easily mislead us to use the 0
 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]:
+        ans = 0
+        for c in costs:
+            if coins < c:
                 break
             else:
                 ans += 1
-                coins -= costs[i]
+                coins -= c
         return ans
 ```
 
@@ -86,6 +85,24 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxIceCream(vector<int>& costs, int coins) {
+        sort(costs.begin(), costs.end());
+        int ans = 0;
+        for (int i = 0; i < costs.size() && coins >= costs[i]; ++i)
+        {
+            ++ans;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+};
+```
+
 ### **Go**
 
 ```go
diff --git a/solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.cpp b/solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int maxIceCream(vector<int>& costs, int coins) {
+        sort(costs.begin(), costs.end());
+        int ans = 0;
+        for (int i = 0; i < costs.size() && coins >= costs[i]; ++i)
+        {
+            ++ans;
+            coins -= costs[i];
+        }
+        return ans;
+    }
+};
diff --git a/solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.py b/solution/1800-1899/1833.Maximum Ice Cream Bars/Solution.py
@@ -1,11 +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]:
+        ans = 0
+        for c in costs:
+            if coins < c:
                 break
             else:
                 ans += 1
-                coins -= costs[i]
-        return ans
+                coins -= c
+        return ans
