1404. Number of Steps to Reduce a Number in Binary Representation to One.cpp

class Solution {
public:
    int numSteps(string s) {
        int n = s.length();
        int ans = n - 1, carry = 0;

        for (int i = n - 1; i > 0; i--) {
            if (s[i] - '0' + carry == 1) {
                ans++;
                carry = 1;
            }
        }

        return ans + carry;
    }
};