FilesExpand file tree

 master

/

problem-25.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

50 lines (38 loc) · 1.31 KB

 master

/

problem-25.js

Copy path

Top

File metadata and controls

• Code
• Blame

50 lines (38 loc) · 1.31 KB

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

38

39

40

41

42

43

44

45

46

47

48

49

50

// Problem description

/* 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].

Example 2:

Input: digits = [4,3,2,1]

Output: [4,3,2,2]

Explanation: The array represents the integer 4321.

Incrementing by one gives 4321 + 1 = 4322.

Thus, the result should be [4,3,2,2].

Example 3:

Input: digits = [9]

Output: [1,0]

Explanation: The array represents the integer 9.

Incrementing by one gives 9 + 1 = 10.

Thus, the result should be [1,0]. */

// solution

let digits = [6, 1, 4, 5, 3, 9, 0, 1, 9, 5, 1, 8, 6, 7, 0, 5, 5, 4, 3];

let plusOne = function (digits) {

let result = [];

let str = '';

for (let i = 0; i < digits.length; i++) {

str += digits[i];

}

let incrementNumber = str * 1 + 1;

result = incrementNumber

.toString()

.split('')

.map((i) => Number(i));

// final Array

return result;

};

console.log(plusOne(digits));