leetcode

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

max_num_ops_move_one_end.c (832B)

 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
// 3228. Maximum Number of Operations to Move Ones to the End
#include "leetcode.h"

/*
 * you are given a binary string 's'. you can perform the followiong operation
 * on the string any number of timees: choose any index 'i' from the string
 * where 'i + 1 < s.length' such that 's[i] == 1' and 's[i + 1] == 0'. move the
 * character 's[i]' to the right until it reaches the end of the string or
 * another 1. return the maximum number of operations that you can perform.
 */

int maxOperations(char *s) {
  int ans = 0, ones = 0, n = strlen(s);
  for (int i = 0; i < n; ++i) {
    ones += s[i] - '0';
    if (i > 0 && s[i] < s[i - 1])
      ans += ones;
  }
  return ans;
}

int main() {
  char *s1 = "1001101", *s2 = "00111";
  printf("%d\n", maxOperations(s1)); // expect: 4
  printf("%d\n", maxOperations(s2)); // expect: 0
}