FilesExpand file tree

 master

/

PlusOne.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (30 loc) · 899 Bytes

 master

/

PlusOne.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (30 loc) · 899 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

/**

* Practiced on 12/18/2012

*

* Given a number represented as an array of digits, plus one to the number.

*

* ===============================

* It needs some observations to write simple codes.

*/

package com.congli.leetcode;

public class PlusOne {

public int[] plusOne(int[] digits)

{

if(digits.length == 0) return digits;

int carrier = 1;

for(int i = digits.length-1; i >= 0; --i)

{

int num = (digits[i]+carrier) % 10;

carrier = (digits[i]+carrier) / 10;

digits[i] = num;

}

if(carrier == 0)

return digits;

// If carrier == 1, it means digit[0] = 0 already.

int[] result = new int[digits.length+1];

result[0] = 1;

for(int j = 0; j < digits.length; ++j)

result[j+1] = digits[j];

return result;

}

}