程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode:Plus One

LeetCode:Plus One

編輯:C++入門知識

LeetCode: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.


// https://oj.leetcode.com/problems/plus-one/
// Author : Chao Zeng
// Date   : 2015-1-29
class Solution {
public:
    vector plusOne(vector &digits) {
        vector  numbers;
        reverse(digits.begin(),digits.end());
        int length = digits.size();
        digits[0]++;
        int temp;
        for (int i = 0; i < length; i++){
            //注意語句的順序
            temp = digits[i] / 10;
            digits[i] = digits[i] % 10;
            numbers.push_back(digits[i]);
            //進位的處理
            if (i == length - 1 && temp > 0){
                numbers.push_back(temp);
            }
            else{
                digits[i+1] = digits[i+1] + temp;
            }
        }
        reverse(numbers.begin(),numbers.end());
        return numbers;
    }
};


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved