Leetcode high precision Plus One

Leetcode high precision Plus One

 

 

Plus OneTotal Accepted: 17614 Total Submissions: 55852My Submissions

 

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.

 

Given an array that represents a large integer, each element of the array adds 1 to each digit in decimal notation of the expected number.
Idea: high-precision Addition
Complexity: Time: O (n)

 

Vector

 
  
PlusOne (vector

  
   
& Digits) {int carry = 1; for (auto it = digits. rbegin (); it! = Digits. rend (); ++ it) {int tmp = * it + carry; * it = tmp % 10; carry = tmp/10; if (! Carry) break;} if (carry) digits. insert (digits. begin (), carry); return digits ;}