add 1626

fishercoder1534 · fishercoder1534 · commit 0ae4d97779fc · 2020-10-18T11:02:53.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) ||DP|Medium|
 |1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) ||BFS, DFS|Medium|
 |1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) ||String|Easy|
 |1620|[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) ||Greedy|Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_1626.java b/src/main/java/com/fishercoder/solutions/_1626.java
@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1626 {
+    public static class Solution1 {
+        public int bestTeamScore(int[] scores, int[] ages) {
+            int len = scores.length;
+            int[][] players = new int[len][2];
+            for (int i = 0; i < len; i++) {
+                players[i][0] = ages[i];
+                players[i][1] = scores[i];
+            }
+            //sort by age first, if tie, then sort by scores
+            Arrays.sort(players, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
+
+            //dp array is the max possible score up to this age, i.e. dp[2] means the max score up to from age 0 up to age 2
+            int[] dp = new int[len];
+            dp[0] = players[0][1];
+            for (int i = 1; i < len; i++) {
+                int maxScoreUpToAgeI = players[i][1];//this is the max score possible on this age i alone
+                for (int j = 0; j < i; j++) {
+                    //then we try to find all possible scores from the min age up to this age i
+                    if (players[i][1] >= players[j][1]) {
+                        maxScoreUpToAgeI = Math.max(maxScoreUpToAgeI, dp[j] + players[i][1]);
+                    }
+                }
+                dp[i] = maxScoreUpToAgeI;
+            }
+            int bestScore = 0;
+            for (int score : dp) {
+                bestScore = Math.max(bestScore, score);
+            }
+            return bestScore;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1626Test.java b/src/test/java/com/fishercoder/_1626Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1626;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1626Test {
+    private static _1626.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1626.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(6, solution1.bestTeamScore(new int[]{1, 2, 3, 5}, new int[]{8, 9, 10, 1}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(34, solution1.bestTeamScore(new int[]{1, 3, 5, 10, 15}, new int[]{1, 2, 3, 4, 5}));
+    }
+
+}
