feat: add solutions to lc problem: No.2293

No.2293.Min Max Game

Author: yanglbme

solution/1800-1899/1815.Maximum Number of Groups Getting Fresh Donuts/README.md

@@ -50,7 +50,24 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxHappyGroups(self, batchSize: int, groups: List[int]) -> int:
+        @cache
+        def dfs(state, x):
+            if state == mask:
+                return 0
+            vis = [False] * batchSize
+            res = 0
+            for i, v in enumerate(g):
+                if state >> i & 1 == 0 and not vis[v]:
+                    vis[v] = True
+                    y = (x + v) % batchSize
+                    res = max(res, dfs(state | 1 << i, y))
+            return res + (x == 0)
+
+        g = [v % batchSize for v in groups if v % batchSize]
+        mask = (1 << len(g)) - 1
+        return len(groups) - len(g) + dfs(0, 0)
 ```
 
 ### **Java**

solution/1800-1899/1815.Maximum Number of Groups Getting Fresh Donuts/README_EN.md

@@ -42,7 +42,24 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxHappyGroups(self, batchSize: int, groups: List[int]) -> int:
+        @cache
+        def dfs(state, x):
+            if state == mask:
+                return 0
+            vis = [False] * batchSize
+            res = 0
+            for i, v in enumerate(g):
+                if state >> i & 1 == 0 and not vis[v]:
+                    vis[v] = True
+                    y = (x + v) % batchSize
+                    res = max(res, dfs(state | 1 << i, y))
+            return res + (x == 0)
+
+        g = [v % batchSize for v in groups if v % batchSize]
+        mask = (1 << len(g)) - 1
+        return len(groups) - len(g) + dfs(0, 0)
 ```
 
 ### **Java**

solution/1800-1899/1815.Maximum Number of Groups Getting Fresh Donuts/Solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def maxHappyGroups(self, batchSize: int, groups: List[int]) -> int:
+        @cache
+        def dfs(state, x):
+            if state == mask:
+                return 0
+            vis = [False] * batchSize
+            res = 0
+            for i, v in enumerate(g):
+                if state >> i & 1 == 0 and not vis[v]:
+                    vis[v] = True
+                    y = (x + v) % batchSize
+                    res = max(res, dfs(state | 1 << i, y))
+            return res + (x == 0)
+
+        g = [v % batchSize for v in groups if v % batchSize]
+        mask = (1 << len(g)) - 1
+        return len(groups) - len(g) + dfs(0, 0)

solution/1800-1899/1816.Truncate Sentence/README.md

@@ -57,6 +57,14 @@ s 中的单词为 ["What", "is" "the", "solution", "to", "this", "problem"]
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：模拟**
+
+我们从前往后遍历字符串 $s$，对于当前遍历到的字符 $s[i]$，如果 $s[i]$ 是空格，那么 $k$ 自减 1，当 $k$ 为 0 时，说明已经截取了 $k$ 个单词，截取字符串 $s[0:i]$ 返回即可。
+
+遍历结束，返回 $s$ 即可。
+
+时间复杂度 $O(n)$，其中 $n$ 为字符串 $s$ 的长度。忽略答案的空间消耗，空间复杂度 $O(1)$。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -73,8 +81,7 @@ class Solution:
 class Solution:
     def truncateSentence(self, s: str, k: int) -> str:
         for i, c in enumerate(s):
-            if c == ' ':
-                k -= 1
+            k -= c == ' '
             if k == 0:
                 return s[:i]
         return s

solution/1800-1899/1816.Truncate Sentence/README_EN.md

@@ -68,8 +68,7 @@ class Solution:
 class Solution:
     def truncateSentence(self, s: str, k: int) -> str:
         for i, c in enumerate(s):
-            if c == ' ':
-                k -= 1
+            k -= c == ' '
             if k == 0:
                 return s[:i]
         return s

solution/1800-1899/1816.Truncate Sentence/Solution.py

@@ -1,8 +1,7 @@
 class Solution:
     def truncateSentence(self, s: str, k: int) -> str:
         for i, c in enumerate(s):
-            if c == ' ':
-                k -= 1
+            k -= c == ' '
             if k == 0:
                 return s[:i]
         return s

solution/2200-2299/2293.Min Max Game/README.md

@@ -60,6 +60,10 @@
 
 **方法一：模拟**
 
+根据题意，我们可以模拟整个过程，最后剩下的数字即为答案。在实现上，我们不需要额外创建数组，直接在原数组上进行操作即可。
+
+时间复杂度 $O(\log n)$，空间复杂度 $O(1)$。其中 $n$ 为数组 `nums` 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -70,17 +74,12 @@
 class Solution:
     def minMaxGame(self, nums: List[int]) -> int:
         n = len(nums)
-        if n == 1:
-            return nums[0]
-        t = []
-        for i in range(n >> 1):
-            v = (
-                max(nums[i << 1], nums[i << 1 | 1])
-                if i & 1
-                else min(nums[i << 1], nums[i << 1 | 1])
-            )
-            t.append(v)
-        return self.minMaxGame(t)
+        while n > 1:
+            n >>= 1
+            for i in range(n):
+                a, b = nums[i << 1], nums[i << 1 | 1]
+                nums[i] = min(a, b) if i % 2 == 0 else max(a, b)
+        return nums[0]
 ```
 
 ### **Java**
@@ -90,16 +89,14 @@ class Solution:
 ```java
 class Solution {
     public int minMaxGame(int[] nums) {
-        int n = nums.length;
-        if (n == 1) {
-            return nums[0];
-        }
-        int[] t = new int[n >> 1];
-        for (int i = 0; i < t.length; ++i) {
-            int a = nums[i << 1], b = nums[i << 1 | 1];
-            t[i] = (i & 1) == 1 ? Math.max(a, b) : Math.min(a, b);
+        for (int n = nums.length; n > 1;) {
+            n >>= 1;
+            for (int i = 0; i < n; ++i) {
+                int a = nums[i << 1], b = nums[i << 1 | 1];
+                nums[i] = i % 2 == 0 ? Math.min(a, b) : Math.max(a, b);
+            }
         }
-        return minMaxGame(t);
+        return nums[0];
     }
 }
 ```
@@ -110,14 +107,14 @@ class Solution {
 class Solution {
 public:
     int minMaxGame(vector<int>& nums) {
-        int n = nums.size();
-        if (n == 1) return nums[0];
-        vector<int> t(n >> 1);
-        for (int i = 0; i < t.size(); ++i) {
-            int a = nums[i << 1], b = nums[i << 1 | 1];
-            t[i] = (i & 1) == 1 ? max(a, b) : min(a, b);
+        for (int n = nums.size(); n > 1;) {
+            n >>= 1;
+            for (int i = 0; i < n; ++i) {
+                int a = nums[i << 1], b = nums[i << 1 | 1];
+                nums[i] = i % 2 == 0 ? min(a, b) : max(a, b);
+            }
         }
-        return minMaxGame(t);
+        return nums[0];
     }
 };
 ```
@@ -126,31 +123,29 @@ public:
 
 ```go
 func minMaxGame(nums []int) int {
-	n := len(nums)
-	if n == 1 {
-		return nums[0]
-	}
-	var t []int
-	for i := 0; i < n>>1; i++ {
-		a, b := nums[i<<1], nums[i<<1|1]
-		if (i & 1) == 1 {
-			t = append(t, max(a, b))
-		} else {
-			t = append(t, min(a, b))
+	for n := len(nums); n > 1; {
+		n >>= 1
+		for i := 0; i < n; i++ {
+			a, b := nums[i<<1], nums[i<<1|1]
+			if i%2 == 0 {
+				nums[i] = min(a, b)
+			} else {
+				nums[i] = max(a, b)
+			}
 		}
 	}
-	return minMaxGame(t)
+	return nums[0]
 }
 
-func max(a, b int) int {
-	if a > b {
+func min(a, b int) int {
+	if a < b {
 		return a
 	}
 	return b
 }
 
-func min(a, b int) int {
-	if a < b {
+func max(a, b int) int {
+	if a > b {
 		return a
 	}
 	return b
@@ -161,17 +156,13 @@ func min(a, b int) int {
 
 ```ts
 function minMaxGame(nums: number[]): number {
-    while (nums.length > 1) {
-        let n = nums.length;
-        let tmp = [];
-        for (let i = 0; i < n; i += 2) {
-            if (i % 4 == 2) {
-                tmp.push(Math.max(nums[i], nums[i + 1]));
-            } else {
-                tmp.push(Math.min(nums[i], nums[i + 1]));
-            }
+    for (let n = nums.length; n > 1; ) {
+        n >>= 1;
+        for (let i = 0; i < n; ++i) {
+            const a = nums[i << 1];
+            const b = nums[(i << 1) | 1];
+            nums[i] = i % 2 == 0 ? Math.min(a, b) : Math.max(a, b);
         }
-        nums = tmp;
     }
     return nums[0];
 }