【Leetcode_easy】717. 1-bit and 2-bit Characters

problem

题意：
solution1:

class Solution {

public:

    bool isOneBitCharacter(vector<int>& bits) {

       int i=;

        while(i<bits.size()-)

        {

            if(bits[i]==) i+=;

            else i+=;

        }

        return i==bits.size()-;

    }

};

solution2:根据数组的特性计算。

class Solution {

public:

    bool isOneBitCharacter(vector<int>& bits) {

       int i=, n = bits.size();

        while(i<n-)

        {

            //if(bits[i]==0) i+=1;

            //else i+=2;

            i += bits[i]+;

        }

        return i==n-;

    }

};

参考

1. Leetcode_easy_717. 1-bit and 2-bit Characters;

2. Grandyang;

完

巴特西

【Leetcode_easy】717. 1-bit and 2-bit Characters

最新文章

热门文章