Leetcode+ 66 - 70 high precision, two sub topics

Add one

Algorithm tags ： Array 、 mathematics

  

Give us an integer , This integer is represented by an array , Add... To this integer 1, Add 1 After that, we use array to represent , The highest bit of the array is placed at 0 A place , Put the second highest order to the 1 A place , Suppose this array has no leading 0, In fact, it gives a very long integer , Simulate the process of addition

Because the highest bit may carry , So you need to flip the array first , Keep your position at the 0 A place , Ten in the first place 1 A place , Start with a bit , Calculate the value of the current bit each time , See if there is a carry , If there is a carry, carry one

How to calculate the number in the current position each time ？

A bit should be the number in the original position plus 1, Plus the carry , add 1 It can be seen as a step forward , Each digit can be regarded as the original digit plus the carry , The carry can be 0 It can also be 1, After adding , The number of current positions is the sum of this number divided by 10 The remainder of , The carry is the sum and division of this number