Sponsored
Sponsored
To form the maximum odd binary number from a given binary string, observe that the binary number should have '1' at the end to be odd. Among the remaining bits, arrange as many '1's as possible at the leading positions while maintaining the '1' at the end. This approach involves counting the occurrences of '1' and '0', then constructing the number.
Time Complexity: O(n), where n is the length of the string as it needs one pass to count and another to construct.
Space Complexity: O(1) for the counting variables.
#include <string>
using namespace std;
string maxOddBinaryNumber(const string &s) {
int ones = 0, zeros = 0;
for (char c : s) {
if (c == '1')
ones++;
else
zeros++;
}
string result(ones - 1, '1');
result.append(string(zeros, '0'));
result += '1';
return result;
}
int main() {
string s = "0101";
cout << maxOddBinaryNumber(s) << endl;
return 0;
}This solution uses string manipulation, counting the number of '1's and '0's. It constructs a new string with maximum leading '1's and a trailing '1' to ensure oddness.
A different approach involves sorting the binary string while ensuring a '1' is at the end. To maximize the binary number, the initial part of the string should consist of leading '1's followed by '0's, then append a single '1' at the end to turn the number odd.
Time Complexity: O(n log n) for sorting.
Space Complexity: O(1) assuming sorting in place is allowed.
1def max_odd_binary_number(s):
2 s = sorted(s, reverse=True)
3 last_one_index = ''.join(s).rfind('1')
4 s.append(s.pop(last_one_index))
5 return ''.join(s)
6
7s = "0101"
8print(max_odd_binary_number(s))Python's sort creates a new ordered list, and list operations reassign elements to ensure the resulting number is odd.
Solve with full IDE support and test cases