PlusOne

You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.

Increment the large integer by one and return the resulting array of digits.

 

Example 1:

Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Incrementing by one gives 123 + 1 = 124.
Thus, the result should be [1,2,4].


#include <iostream>

using namespace std;

int main()
{
  int n,rem;
  cin>>n;
  int a[n];
  for(int i=0;i<n;i++){
      cin>>a[i];
      rem = a[i]%10;
      
  }
  rem= rem+1;
  a[n-1] = rem;
  for(int i=0;i<n;i++){
      cout<<a[i];
  }
 
   
   }