feat: add solutions to lc problem: No.1561

No.1561.Maximum Number of Coins You Can Get

Author: yanglbme

lcci/05.07.Exchange/Solution.py

@@ -1,3 +1,3 @@
 class Solution:
     def exchangeBits(self, num: int) -> int:
-        return ((num & 0x55555555) << 1) | ((num & 0xaaaaaaaa) >> 1)
+        return ((num & 0x55555555) << 1) | ((num & 0xAAAAAAAA) >> 1)

lcci/17.12.BiNode/Solution.py

@@ -5,6 +5,7 @@
 #         self.left = None
 #         self.right = None
 
+
 class Solution:
     def convertBiNode(self, root: TreeNode) -> TreeNode:
         def dfs(root):

solution/0400-0499/0479.Largest Palindrome Product/Solution.py

@@ -11,4 +11,4 @@ def largestPalindrome(self, n: int) -> int:
                 if x % t == 0:
                     return x % 1337
                 t -= 1
-        return 9
+        return 9

solution/1500-1599/1561.Maximum Number of Coins You Can Get/README.md

@@ -58,22 +58,67 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：贪心**
+
+Bob 取走最小的 1/3，剩余的硬币堆由 Alice 和我按硬币数从高到低依次取走每一堆。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxCoins(self, piles: List[int]) -> int:
+        piles.sort()
+        return sum(piles[-2 : len(piles) // 3 - 1 : -2])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+
+    public int maxCoins(int[] piles) {
+        Arrays.sort(piles);
+        int ans = 0;
+        for (int i = piles.length - 2; i >= piles.length / 3; i -= 2) {
+            ans += piles[i];
+        }
+        return ans;
+    }
+}
+
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxCoins(vector<int>& piles) {
+        sort(piles.begin(), piles.end());
+        int ans = 0;
+        for (int i = piles.size() - 2; i >= (int) piles.size() / 3; i -= 2) ans += piles[i];
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxCoins(piles []int) int {
+	sort.Ints(piles)
+	ans, n := 0, len(piles)
+	for i := n - 2; i >= n/3; i -= 2 {
+		ans += piles[i]
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1500-1599/1561.Maximum Number of Coins You Can Get/README_EN.md

@@ -55,18 +55,59 @@ On the other hand if we choose this arrangement (1, <strong>2</strong>, 8), (2,
 
 ## Solutions
 
+Greedy.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxCoins(self, piles: List[int]) -> int:
+        piles.sort()
+        return sum(piles[-2 : len(piles) // 3 - 1 : -2])
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int maxCoins(int[] piles) {
+        Arrays.sort(piles);
+        int ans = 0;
+        for (int i = piles.length - 2; i >= piles.length / 3; i -= 2) {
+            ans += piles[i];
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxCoins(vector<int>& piles) {
+        sort(piles.begin(), piles.end());
+        int ans = 0;
+        for (int i = piles.size() - 2; i >= (int) piles.size() / 3; i -= 2) ans += piles[i];
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxCoins(piles []int) int {
+	sort.Ints(piles)
+	ans, n := 0, len(piles)
+	for i := n - 2; i >= n/3; i -= 2 {
+		ans += piles[i]
+	}
+	return ans
+}
 ```
 
 ### **...**

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    int maxCoins(vector<int>& piles) {
+        sort(piles.begin(), piles.end());
+        int ans = 0;
+        for (int i = piles.size() - 2; i >= (int) piles.size() / 3; i -= 2) ans += piles[i];
+        return ans;
+    }
+};

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.go

@@ -0,0 +1,8 @@
+func maxCoins(piles []int) int {
+	sort.Ints(piles)
+	ans, n := 0, len(piles)
+	for i := n - 2; i >= n/3; i -= 2 {
+		ans += piles[i]
+	}
+	return ans
+}

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.java

@@ -1,11 +1,9 @@
 class Solution {
     public int maxCoins(int[] piles) {
         Arrays.sort(piles);
-        int start = 0, end = piles.length - 1, ans = 0;
-        while (start < end) {
-            ans += piles[end - 1];
-            start++;
-            end -= 2;
+        int ans = 0;
+        for (int i = piles.length - 2; i >= piles.length / 3; i -= 2) {
+            ans += piles[i];
         }
         return ans;
     }

solution/1500-1599/1561.Maximum Number of Coins You Can Get/Solution.py

@@ -0,0 +1,4 @@
+class Solution:
+    def maxCoins(self, piles: List[int]) -> int:
+        piles.sort()
+        return sum(piles[-2 : len(piles) // 3 - 1 : -2])

solution/2200-2299/2237.Count Positions on Street With Required Brightness/Solution.py

@@ -1,5 +1,7 @@
 class Solution:
-    def meetRequirement(self, n: int, lights: List[List[int]], requirement: List[int]) -> int:
+    def meetRequirement(
+        self, n: int, lights: List[List[int]], requirement: List[int]
+    ) -> int:
         d = [0] * 100010
         for p, r in lights:
             i, j = max(0, p - r), min(n - 1, p + r)