LeetCode Note One - Plus One

• Plus One

  Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

  The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

  You may assume the integer does not contain any leading zero, except the number 0 itself.

Algorithm flow:

program

#include <vector> 
using namespace std; 
class Solution 
{ 
public:
     vector<int> plusOne(vector<int>& digits) {
          int n = digits.size();
          for(int i = n-1; i >= 0; i--)
             {         
             	if(digits[i]==9)         
             	{             
             		digits[i] = 0;         
             	}         
             	else         
             	{             
             		digits[i]++;             
             		return digits;         
             	}      
             }     
             digits[0] = 1;     
             digits.push_back(0);     
             return digits;       
        } 
};