leetcode Plus One

Plus One

  Total Accepted: 61952  Total Submissions: 205031 My Submissions

Question  Solution 

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.

Show Tags

Show Similar Problems

// test66plusOne.cpp : 定义控制台应用程序的入口点。

//该题主要是考虑到不要越界，另外就是vector指定位置插入问题。


#include "stdafx.h"
#include "vector"
using std::vector;
vector<int> plusOne(vector<int>& digits);
vector<int> nweiplusOne(vector<int>& digits, int n);
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> a = {9,9,8};
vector<int> c=plusOne(a);
return 0;
}


vector<int> plusOne(vector<int>& digits) 
{
int n = digits.size();
nweiplusOne(digits, n - 1);
return digits;
}
vector<int> nweiplusOne(vector<int>& digits, int n)
{
if (n == 0)
{
if (digits[0] != 9)
{
digits[0] += 1;
return digits;
}
else
{
digits[0] = 0;
digits.insert(digits.begin(), 1);//注意此处，在vector的头部插入一个元素。
return digits;
}


}
if (digits[n] != 9)
{
digits[n] += 1;
return digits;
}
else
{
digits[n] = 0;
nweiplusOne(digits, n - 1);
}
return digits;
}