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 2864 with 14 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2864 # by problem number
lcpy gen -s maximum_odd_binary_number # by problem name
s that contains at least one '1'.
You have to rearrange the bits in such a way that the resulting binary number is the maximum odd binary number that can be created from this combination.
Return a string representing the maximum odd binary number that can be created from the given combination.
Note that the resulting string can have leading zeros.
Input: s = "010"
Output: "001"
Explanation: Because there is just one '1', it must be in the last position. So the answer is "001".
Input: s = "0101"
Output: "1001"
Explanation: One of the '1's must be in the last position. The maximum number that can be made with the remaining digits is "100". So the answer is "1001".
1 <= s.length <= 100s consists only of '0' and '1'.s contains at least one '1'.class Solution:
# Time: O(n)
# Space: O(n)
def maximum_odd_binary_number(self, s: str) -> str:
ones = s.count("1")
zeros = len(s) - ones
return "1" * (ones - 1) + "0" * zeros + "1"
| Time | Space |
|---|---|
| O(n) | O(n) |