leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

max_odd_binary_num.c (858B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// 2864. Maximum Odd Binary Number
#include "leetcode.h"

/*
 * 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.
 */

char *maximumOddBinaryNumber(char *s) {
  int n = strlen(s), one = 0;
  for (int i = 0; i < n; ++i)
    if (s[i] == '1')
      one++;
  for (int i = 0; i < n - 1; ++i) {
    if (one > 1) {
      s[i] = '1';
      --one;
    } else
      s[i] = '0';
  }
  s[n - 1] = '1';
  return s;
}

int main() {
  char *s1 = "010", *s2 = "0101";
  printf("%s\n", maximumOddBinaryNumber(s1)); // expect: 001
  printf("%s\n", maximumOddBinaryNumber(s2)); // expect: 1001
}