leetcode

0 class Solution {

1 public:

2 int numSteps(const string &s) const {

3 int res = 0, add = 0;

4

5 for (int i = size(s) - 1; i > 0; i--) {

6 if (s[i] - '0' + add == 1) add = 1, res++;

7 res++;

8 }

9

10 return res + add;

11 }

12 };