[LeetCode]66. Plus One ★

题目描述

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.
题目大意：给定一个非空的由数字组成的数组，代表一个数字，计算这个数字加1后的数值。这个数字没有前导0，除非这个数字是0

样例

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

python解法

class Solution:
    def plusOne(self, digits: List[int]) -> List[int]:
        if digits[-1]<9:
            digits[-1] += 1
            return digits
        returndigits = []
        t = 1
        for val in digits[::-1]:
            returndigits.append((val+t)%10)
            t = (val+t)//10
        if t:
            returndigits.append(1)
        returndigits.reverse()
        return returndigits

Runtime: 36 ms, faster than 86.31% of Python3 online submissions for Plus One.
Memory Usage: 13.8 MB, less than 5.04% of Python3 online submissions for Plus One.
题后反思：

1. 列表的reverse函数改变的是列表本身，返回值为None

C语言解法

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* plusOne(int* digits, int digitsSize, int* returnSize){
    if (digits[digitsSize-1]<9)
    {
        digits[digitsSize-1] = digits[digitsSize-1]+1;
        * returnSize = digitsSize;
        return digits;
    }
    int *returnArray = (int *)malloc(sizeof(int)*(digitsSize+1));
    int t = 0;
    returnArray[digitsSize] = 0;
    t = 1;
    for(int i=digitsSize-2;i>=0;i--)
    {
        if (t)
        {
            returnArray[i+1] = (digits[i]+t)%10;
            t = (digits[i]+t)/10;
        }
        else
        {
            returnArray[i+1] = digits[i];
        }
    }
    if(t)
    {
        returnArray[0] = 1;
        * returnSize = digitsSize+1;
        return returnArray;
    }
    else
    {
        * returnSize = digitsSize;
        return returnArray+1;
    }
}

Runtime: 4 ms, faster than 70.11% of C online submissions for Plus One.
Memory Usage: 7.2 MB, less than 61.76% of C online submissions for Plus One.
题后反思：无

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步