Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1903 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1903 # by problem number
lcpy gen -s largest_odd_number_in_string # by problem name
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.
Input: num = "52"
Output: "5"
Explanation: The only non-empty substrings are "5", "2", and "52". "5" is the only odd number.
Input: num = "4206"
Output: ""
Explanation: There are no odd numbers in "4206".
Input: num = "35427"
Output: "35427"
Explanation: "35427" is already an odd number.
class Solution:
# Time: O(n)
# Space: O(1)
def largest_odd_number(self, num: str) -> str:
for i in range(len(num) - 1, -1, -1):
if int(num[i]) % 2 == 1:
return num[: i + 1]
return ""
| Time | Space |
|---|---|
| O(n) | O(1) |