Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commite068f1a

Browse files
author
applewjg
committed
Plus ONe
Change-Id: I3d9f1a742c99bf4415dae6d14dd540041f31280a
1 parentde567df commite068f1a

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed

‎PlusOne.java

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
/*
2+
Author: King, wangjingui@outlook.com
3+
Date: Dec 25, 2014
4+
Problem: Plus One
5+
Difficulty: Easy
6+
Source: https://oj.leetcode.com/problems/plus-one/
7+
Notes:
8+
Given a number represented as an array of digits, plus one to the number.
9+
10+
Solution: ...
11+
*/
12+
13+
publicclassSolution {
14+
publicint[]plusOne(int[]digits) {
15+
if (digits.length ==0)returndigits;
16+
intcarry =1;
17+
for (inti =digits.length -1;i >=0; --i) {
18+
digits[i] +=carry;
19+
carry =digits[i] /10;
20+
digits[i] =digits[i] %10;
21+
}
22+
if (carry ==0)returndigits;
23+
int[]res =newint[digits.length +1];
24+
res[0] =carry;
25+
System.arraycopy(digits,0,res,1,digits.length);
26+
returnres;
27+
}
28+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp