add 1561

fishercoder1534 · fishercoder1534 · commit ecd89b9b4a7b · 2020-08-23T06:43:36.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1561|[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) ||Sort|Medium|
 |1560|[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) ||Array|Easy|
 |1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) ||Medium|Greedy|
 |1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) ||Medium|Graph|
diff --git a/src/main/java/com/fishercoder/solutions/_1561.java b/src/main/java/com/fishercoder/solutions/_1561.java
@@ -0,0 +1,20 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1561 {
+    public static class Solution1 {
+        public int maxCoins(int[] piles) {
+            Arrays.sort(piles);
+            int j = 0;
+            int coins = 0;
+            for (int i = piles.length - 2; i > 0; i -= 2) {
+                coins += piles[i];
+                if (++j == piles.length / 3) {
+                    return coins;
+                }
+            }
+            return coins;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1561Test.java b/src/test/java/com/fishercoder/_1561Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1561;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1561Test {
+    private static _1561.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1561.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9, solution1.maxCoins(new int[]{2, 4, 1, 2, 7, 8}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(4, solution1.maxCoins(new int[]{2, 4, 5}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(18, solution1.maxCoins(new int[]{9, 8, 7, 6, 5, 1, 2, 3, 4}));
+    }
+
+}
