Skip to content

Commit 77f055a

Browse files
solves largest odd number in a string
1 parent 174ecf4 commit 77f055a

File tree

2 files changed

+19
-1
lines changed

2 files changed

+19
-1
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -458,7 +458,7 @@
458458
| 1886 | [Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation) | [![Java](assets/java.png)](src/DetermineWhetherMatrixCanBeObtainedByRotation.java) | |
459459
| 1893 | [Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered) | [![Java](assets/java.png)](src/CheckIfAllTheIntegersInARangeAreCovered.java) | |
460460
| 1897 | [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal) | [![Java](assets/java.png)](src/RedistributeCharactersToMakeAllStringsEqual.java) | |
461-
| 1903 | [Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string) | | |
461+
| 1903 | [Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string) | [![Java](assets/java.png)](src/LargestOddNumberInString.java) | |
462462
| 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing) | | |
463463
| 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs) | | |
464464
| 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation) | | |

src/LargestOddNumberInString.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
// https://leetcode.com/problems/largest-odd-number-in-string
2+
// T: O(|num|)
3+
// S: O(num)
4+
5+
public class LargestOddNumberInString {
6+
public String largestOddNumber(String num) {
7+
for (int i = num.length() - 1 ; i >= 0 ; i--) {
8+
if (isOddDigit(num.charAt(i))) {
9+
return num.substring(0, i + 1);
10+
}
11+
}
12+
return "";
13+
}
14+
15+
private boolean isOddDigit(char digit) {
16+
return (digit - '0') % 2 == 1;
17+
}
18+
}

0 commit comments

Comments
 (0)