Today I have done leetcode's March LeetCoding Challenge with cpp.

March LeetCoding Challenge 1

Description

Maximum Odd Binary Number

You are given a binary string 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.

Example 1:

Input: s = "010"
Output: "001"
Explanation: Because there is just one '1', it must be in the last position. So the answer is "001".

Example 2:

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".

Constraints:

• 1 <= s.length <= 100
• s consists only of '0' and '1'.
• s contains at least one '1'.

Solution

class Solution {
public:
  string maximumOddBinaryNumber(string s) {
    int ones = 0;
    for(auto c : s) {
      ones += c - '0';
    }
    string answer;
    while(ones > 1) {
      answer.push_back('1');
      ones -= 1;
    }
    while(answer.length() + 1 < s.length()) {
      answer.push_back('0');
    }
    answer.push_back('1');
    return answer;
  }
};

// Accepted
// 985/985 cases passed (4 ms)
// Your runtime beats 61.13 % of cpp submissions
// Your memory usage beats 55.89 % of cpp submissions (8.3 MB)