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<int> plusOne(vector<int> &digits) { vector <int> 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; } };
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。