Merge pull request #149 from fartem/delete-greatest-value-in-each-row

2023-01-06 update: added "2500. Delete Greatest Value in Each Row"

Author: fartem

README.md

@@ -426,6 +426,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2481. Minimum Cuts to Divide a Circle                                    | [Link](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/)                                    | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MinimumCutsToDivideACircle.java)                                   |
 | 2490. Circular Sentence                                                  | [Link](https://leetcode.com/problems/circular-sentence/)                                                  | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CircularSentence.java)                                             |
 | 2496. Maximum Value of a String in an Array                              | [Link](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                              | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MaximumValueOfAStringInAnArray.java)                               |
+| 2500. Delete Greatest Value in Each Row                                  | [Link](https://leetcode.com/problems/delete-greatest-value-in-each-row/)                                  | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/DeleteGreatestValueInEachRow.java)                                 |
 | 2506. Count Pairs Of Similar Strings                                     | [Link](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                     | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CountPairsOfSimilarStrings.java)                                   |
 | 2515. Shortest Distance to Target String in a Circular Array             | [Link](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)             | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ShortestDistanceToTargetStringInACircularArray.java)               |
 | 2520. Count the Digits That Divide a Number                              | [Link](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)                              | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/CountTheDigitsThatDivideANumber.java)                              |

src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/DeleteGreatestValueInEachRow.java

@@ -0,0 +1,29 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import java.util.Arrays;
+
+// https://leetcode.com/problems/delete-greatest-value-in-each-row/
+public class DeleteGreatestValueInEachRow {
+
+    private final int[][] input;
+
+    public DeleteGreatestValueInEachRow(int[][] input) {
+        this.input = input;
+    }
+
+    public int solution() {
+        for (int[] line : input) {
+            Arrays.sort(line);
+        }
+        int result = 0;
+        for (int i = 0; i < input[0].length; i++) {
+            int max = 0;
+            for (int[] ints : input) {
+                max = Math.max(max, ints[i]);
+            }
+            result += max;
+        }
+        return result;
+    }
+
+}

src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/DeleteGreatestValueInEachRowTest.java

@@ -0,0 +1,23 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class DeleteGreatestValueInEachRowTest {
+
+    @Test
+    public void defaultTests() {
+        assertEquals(
+                8,
+                new DeleteGreatestValueInEachRow(
+                        new int[][]{{1, 2, 4}, {3, 3, 1}}
+                ).solution()
+        );
+        assertEquals(
+                10,
+                new DeleteGreatestValueInEachRow(new int[][]{{10}}).solution()
+        );
+    }
+
+}