FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/code/lc66.java at master · mJackie/leetcode · GitHub
mJackie
/
leetcode
Public
Notifications
You must be signed in to change notification settings
Fork
135
Star
405
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
code
/
lc66.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
31 lines (30 loc) · 843 Bytes
Breadcrumbs
leetcode
/
code
/
lc66.java
Copy path
File metadata and controls
31 lines (30 loc) · 843 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
package
code
;
/*
* 66. Plus One
* 题意:数组中各数字连起来表示一个整数,返回该整数+1后的数组
* 难度:Easy
* 分类:Array, Math
* 注意:考虑全为9的情况,要进位,第一位为1,其他为0
*/
public
class
lc66
{
public
static
void
main
(
String
[]
args
) {
int
[]
nums
=
plusOne
(
new
int
[]{
8
,
9
,
9
,
9
});
for
(
int
i
:
nums
)
System
.
out
.
println
(
i
);
}
public
static
int
[]
plusOne
(
int
[]
digits
) {
for
(
int
i
=
digits
.
length
-
1
;
i
>=
0
;
i
--) {
if
(
digits
[
i
]<
9
) {
digits
[
i
]++;
return
digits
;
}
else
{
//进位,下一位+1
digits
[
i
] =
0
;
}
}
// 全为9
int
[]
res
=
new
int
[
digits
.
length
+
1
];
res
[
0
] =
1
;
return
res
;
}
}
Back
|
FazBrowse Home
|
New Git URL