feat: add solutions to lc problems: No.2706~2713

Author: yanglbme

solution/1400-1499/1439.Find the Kth Smallest Sum of a Matrix With Sorted Rows/README.md

@@ -81,10 +81,8 @@ class Solution:
     def kthSmallest(self, mat: List[List[int]], k: int) -> int:
         pre = [0]
         for cur in mat:
-            t = [a + b for a in pre for b in cur[:k]]
-            t.sort()
-            pre = t[:k]
-        return pre[k - 1]
+            pre = sorted(a + b for a in pre for b in cur[:k])[:k]
+        return pre[-1]
 ```
 
 ### **Java**

solution/1400-1499/1439.Find the Kth Smallest Sum of a Matrix With Sorted Rows/README_EN.md

@@ -59,10 +59,8 @@ class Solution:
     def kthSmallest(self, mat: List[List[int]], k: int) -> int:
         pre = [0]
         for cur in mat:
-            t = [a + b for a in pre for b in cur[:k]]
-            t.sort()
-            pre = t[:k]
-        return pre[k - 1]
+            pre = sorted(a + b for a in pre for b in cur[:k])[:k]
+        return pre[-1]
 ```
 
 ### **Java**

solution/1400-1499/1439.Find the Kth Smallest Sum of a Matrix With Sorted Rows/Solution.py

@@ -2,7 +2,5 @@ class Solution:
     def kthSmallest(self, mat: List[List[int]], k: int) -> int:
         pre = [0]
         for cur in mat:
-            t = [a + b for a in pre for b in cur[:k]]
-            t.sort()
-            pre = t[:k]
-        return pre[k - 1]
+            pre = sorted(a + b for a in pre for b in cur[:k])[:k]
+        return pre[-1]

solution/2700-2799/2706.Buy Two Chocolates/README.md

@@ -0,0 +1,115 @@
+# [2706. 购买两块巧克力](https://leetcode.cn/problems/buy-two-chocolates)
+
+[English Version](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个整数数组&nbsp;<code>prices</code>&nbsp;，它表示一个商店里若干巧克力的价格。同时给你一个整数&nbsp;<code>money</code>&nbsp;，表示你一开始拥有的钱数。</p>
+
+<p>你必须购买 <strong>恰好&nbsp;</strong>两块巧克力，而且剩余的钱数必须是 <strong>非负数</strong>&nbsp;。同时你想最小化购买两块巧克力的总花费。</p>
+
+<p>请你返回在购买两块巧克力后，最多能剩下多少钱。如果购买任意两块巧克力都超过了你拥有的钱，请你返回 <code>money</code>&nbsp;。注意剩余钱数必须是非负数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><b>输入：</b>prices = [1,2,2], money = 3
+<b>输出：</b>0
+<b>解释：</b>分别购买价格为 1 和 2 的巧克力。你剩下 3 - 3 = 0 块钱。所以我们返回 0 。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><b>输入：</b>prices = [3,2,3], money = 3
+<b>输出：</b>3
+<b>解释：</b>购买任意 2 块巧克力都会超过你拥有的钱数，所以我们返回 3 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>2 &lt;= prices.length &lt;= 50</code></li>
+	<li><code>1 &lt;= prices[i] &lt;= 100</code></li>
+	<li><code>1 &lt;= money &lt;= 100</code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+class Solution:
+    def buyChoco(self, prices: List[int], money: int) -> int:
+        prices.sort()
+        cost = prices[0] + prices[1]
+        return money if money < cost else money - cost
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+class Solution {
+    public int buyChoco(int[] prices, int money) {
+        Arrays.sort(prices);
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int buyChoco(vector<int>& prices, int money) {
+        sort(prices.begin(), prices.end());
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+};
+```
+
+### **Go**
+
+```go
+func buyChoco(prices []int, money int) int {
+	sort.Ints(prices)
+	cost := prices[0] + prices[1]
+	if money < cost {
+		return money
+	}
+	return money - cost
+}
+```
+
+### **TypeScript**
+
+```ts
+function buyChoco(prices: number[], money: number): number {
+    prices.sort((a, b) => a - b);
+    const cost = prices[0] + prices[1];
+    return money < cost ? money : money - cost;
+}
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2700-2799/2706.Buy Two Chocolates/README_EN.md

@@ -0,0 +1,107 @@
+# [2706. Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates)
+
+[中文文档](/solution/2700-2799/2706.Buy%20Two%20Chocolates/README.md)
+
+## Description
+
+<p>You are given an integer array <code>prices</code> representing the prices of various chocolates in a store. You are also given a single integer <code>money</code>, which represents your initial amount of money.</p>
+
+<p>You must buy <strong>exactly</strong> two chocolates in such a way that you still have some <strong>non-negative</strong> leftover money. You would like to minimize the sum of the prices of the two chocolates you buy.</p>
+
+<p>Return <em>the amount of money you will have leftover after buying the two chocolates</em>. If there is no way for you to buy two chocolates without ending up in debt, return <code>money</code>. Note that the leftover must be non-negative.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> prices = [1,2,2], money = 3
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> Purchase the chocolates priced at 1 and 2 units respectively. You will have 3 - 3 = 0 units of money afterwards. Thus, we return 0.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> prices = [3,2,3], money = 3
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> You cannot buy 2 chocolates without going in debt, so we return 3.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>2 &lt;= prices.length &lt;= 50</code></li>
+	<li><code>1 &lt;= prices[i] &lt;= 100</code></li>
+	<li><code>1 &lt;= money &lt;= 100</code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+class Solution:
+    def buyChoco(self, prices: List[int], money: int) -> int:
+        prices.sort()
+        cost = prices[0] + prices[1]
+        return money if money < cost else money - cost
+```
+
+### **Java**
+
+```java
+class Solution {
+    public int buyChoco(int[] prices, int money) {
+        Arrays.sort(prices);
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int buyChoco(vector<int>& prices, int money) {
+        sort(prices.begin(), prices.end());
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+};
+```
+
+### **Go**
+
+```go
+func buyChoco(prices []int, money int) int {
+	sort.Ints(prices)
+	cost := prices[0] + prices[1]
+	if money < cost {
+		return money
+	}
+	return money - cost
+}
+```
+
+### **TypeScript**
+
+```ts
+function buyChoco(prices: number[], money: number): number {
+    prices.sort((a, b) => a - b);
+    const cost = prices[0] + prices[1];
+    return money < cost ? money : money - cost;
+}
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2700-2799/2706.Buy Two Chocolates/Solution.cpp

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int buyChoco(vector<int>& prices, int money) {
+        sort(prices.begin(), prices.end());
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+};

solution/2700-2799/2706.Buy Two Chocolates/Solution.go

@@ -0,0 +1,8 @@
+func buyChoco(prices []int, money int) int {
+	sort.Ints(prices)
+	cost := prices[0] + prices[1]
+	if money < cost {
+		return money
+	}
+	return money - cost
+}

solution/2700-2799/2706.Buy Two Chocolates/Solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public int buyChoco(int[] prices, int money) {
+        Arrays.sort(prices);
+        int cost = prices[0] + prices[1];
+        return money < cost ? money : money - cost;
+    }
+}

solution/2700-2799/2706.Buy Two Chocolates/Solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def buyChoco(self, prices: List[int], money: int) -> int:
+        prices.sort()
+        cost = prices[0] + prices[1]
+        return money if money < cost else money - cost

solution/2700-2799/2706.Buy Two Chocolates/Solution.ts

@@ -0,0 +1,5 @@
+function buyChoco(prices: number[], money: number): number {
+    prices.sort((a, b) => a - b);
+    const cost = prices[0] + prices[1];
+    return money < cost ? money : money - cost;
+}