【leetcode】Plus One

來源:互聯網
上載者:User

Question:

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

Anwser 1:  szie  ->  0

class Solution {public:    vector<int> plusOne(vector<int> &digits) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        vector<int> result(digits);                int carry = 1;        int size = digits.size();                for(int i = size - 1; i >= 0 ; i--){            int tmp = result[i] + carry;            result[i] = tmp % 10;            carry = tmp / 10;        }                if(carry > 0){            result.insert(result.begin(), carry);        }                return result;    }};

Anwser 2:  0  ->  szie

class Solution {public:    vector<int> plusOne(vector<int> &digits) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        vector<int> result(digits);        reverse(result.begin(), result.end());                int carry = 1;        int size = digits.size();                for(int i = 0; i < size; i++){            int tmp = result[i] + carry;            result[i] = tmp % 10;            carry = tmp / 10;        }                if(carry == 1){            result.push_back(carry);        }                reverse(result.begin(), result.end());                return result;    }};

參考推薦:
leetcode.com

cplusplus vector

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.