2023-01-04 update: added "2496. Maximum Value of a String in an Array" (#146)

Author: fartem

README.md

@@ -425,6 +425,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2469. Convert the Temperature                                            | [Link](https://leetcode.com/problems/convert-the-temperature/)                                            | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/ConvertTheTemperature.java)                                        |
 | 2481. Minimum Cuts to Divide a Circle                                    | [Link](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/description/)                        | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MinimumCutsToDivideACircle.java)                                   |
 | 2490. Circular Sentence                                                  | [Link](https://leetcode.com/problems/circular-sentence/description/)                                      | [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/description/)                  | [Link](./src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MaximumValueOfAStringInAnArray.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/description/) | [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/MaximumValueOfAStringInAnArray.java

@@ -0,0 +1,31 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+// https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/
+public class MaximumValueOfAStringInAnArray {
+
+    private final String[] input;
+
+    public MaximumValueOfAStringInAnArray(String[] input) {
+        this.input = input;
+    }
+
+    public int solution() {
+        int result = 0;
+        for (String str : input) {
+            boolean isNumber = true;
+            for (int i = 0; i < str.length(); i++) {
+                if (!Character.isDigit(str.charAt(i))) {
+                    isNumber = false;
+                    break;
+                }
+            }
+            if (isNumber) {
+                result = Math.max(result, Integer.parseInt(str));
+            } else {
+                result = Math.max(result, str.length());
+            }
+        }
+        return result;
+    }
+
+}

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

@@ -0,0 +1,25 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class MaximumValueOfAStringInAnArrayTest {
+
+    @Test
+    public void defaultTests() {
+        assertEquals(
+                5,
+                new MaximumValueOfAStringInAnArray(
+                        new String[]{"alic3", "bob", "3", "4", "00000"}
+                ).solution()
+        );
+        assertEquals(
+                1,
+                new MaximumValueOfAStringInAnArray(
+                        new String[]{"1", "01", "001", "0001"}
+                ).solution()
+        );
+    }
+
+}