You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd integer exists.
A substring is a contiguous sequence of characters within a string.
Example 1:
Input: num = "52"
Output: "5"
Explanation: The only non-empty substrings are "5", "2", and "52". "5" is the only odd number.
Example 2:
Input: num = "4206"
Output: ""
Explanation: There are no odd numbers in "4206".
Example 3:
Input: num = "35427"
Output: "35427"
Explanation: "35427" is already an odd number.
Constraints:
- 1 <= num.length <= 105
- num only consists of digits and does not contain any leading zeros.
class Solution:
def largestOddNumber(self, num: str) -> str:
num=num[::-1]
for i in range(len((num))):
if int(num[i])%2==1:
return num[i::][::-1]
return ""
'알고리즘 문제 > Leetcode' 카테고리의 다른 글
2027. Minimum Moves to Convert String (1) | 2022.12.03 |
---|---|
1974. Minimum Time to Type Word Using Special Typewriter (0) | 2022.12.02 |
1827. Minimum Operations to Make the Array Increasing (0) | 2022.12.02 |
1736. Latest Time by Replacing Hidden Digits (0) | 2022.12.02 |
1710. Maximum Units on a Truck (0) | 2022.12.02 |