leetcode-66-Plus One

来源：互联网发布：java gbk转utf8 黑马编辑：程序博客网时间：2024/04/29 12:17

Plus One

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

给你一个数组，代表一个数，对这个数进行加1操作

class Solution { //c++ public:    vector<int> plusOne(vector<int> &digits) {        int i,n=digits.size();        for(i=n-1;i>-1;i--){            digits[i]+=1;            if(digits[i]==10) digits[i]=0;            else break;        }        if(i==-1) digits.insert(digits.begin(),1);        return digits;    }};

class Solution:     #python     # @param {integer[]} digits    # @return {integer[]}    def plusOne(self, digits):        n=len(digits);        for i in range(n):            digits[n-i-1]=digits[n-i-1]+1            if digits[n-i-1]==10:                digits[n-i-1]=0            else:                break        else:i=i+1  #没有从break退出，就执行这一行        if i==n:digits.insert(0,1)        return digits

class Solution:    #python    # @param {integer[]} digits    # @return {integer[]}    def plusOne(self, digits):        n=len(digits);        i=0        while i<n:            digits[n-i-1]=digits[n-i-1]+1            if digits[n-i-1]==10:                digits[n-i-1]=0            else:                break            i=i+1        if i==n:digits.insert(0,1)        return digits

0 0