[LintCode] Plus One 加一运算

  1. 云栖社区>
  2. 博客>
  3. 正文

[LintCode] Plus One 加一运算

李博 bluemind 2017-12-12 18:01:00 浏览664
展开阅读全文

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.

Example

Given [1,2,3] which represents 123, return[1,2,4].

Given [9,9,9] which represents 999, return[1,0,0,0].

LeetCode上的原题,请参见我之前的博客Plus One

解法一:

class Solution {
public:
    /**
     * @param digits a number represented as an array of digits
     * @return the result
     */
    vector<int> plusOne(vector<int>& digits) {
        vector<int> res;
        int carry = 1, n = digits.size();
        for (int i = n - 1; i >= 0; --i) {
            int sum = digits[i] + carry;
            res.insert(res.begin(), sum % 10);
            carry = sum / 10;
        }
        if (carry == 1) res.insert(res.begin(), 1);
        return res;
    }
};

解法二:

class Solution {
public:
    /**
     * @param digits a number represented as an array of digits
     * @return the result
     */
    vector<int> plusOne(vector<int>& digits) {
        for (int i = digits.size() - 1; i >= 0; --i) {
            if (digits[i] < 9) {
                digits[i] += 1;
                return digits;
            }
            digits[i] = 0;
        }
        digits.insert(digits.begin(), 1);
        return digits;
    }
};

本文转自博客园Grandyang的博客,原文链接:加一运算[LintCode] Plus One ,如需转载请自行联系原博主。

网友评论

登录后评论
0/500
评论
李博 bluemind
+ 关注