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

Commit743bba8

Browse files
committed
Modified 3 solutions
1 parentd886046 commit743bba8

File tree

3 files changed

+52
-48
lines changed

3 files changed

+52
-48
lines changed

‎Easy/Add Strings.java

Lines changed: 24 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -1,31 +1,27 @@
11
classSolution {
2-
publicStringaddStrings(Stringnum1,Stringnum2) {
3-
StringBuildersb =newStringBuilder();
4-
intidx1 =num1.length() -1;
5-
intidx2 =num2.length() -1;
6-
intcarry =0;
7-
8-
while (idx1 >=0 ||idx2 >=0) {
9-
inttemp =carry;
10-
if (idx1 >=0 &&idx2 >=0) {
11-
temp += (num1.charAt(idx1) -'0') + (num2.charAt(idx2) -'0');
12-
}
13-
elseif (idx1 >=0 &&idx2 <0) {
14-
temp += (num1.charAt(idx1) -'0');
15-
}
16-
else {
17-
temp += (num2.charAt(idx2) -'0');
18-
}
19-
20-
carry =temp >9 ?temp /10 :0;
21-
temp =temp >9 ?temp %10 :temp;
22-
sb.append(temp);
23-
idx1--;
24-
idx2--;
25-
}
26-
27-
sb.append(carry >0 ?carry :"");
28-
29-
returnsb.reverse().toString();
2+
publicStringaddStrings(Stringnum1,Stringnum2) {
3+
StringBuildersb =newStringBuilder();
4+
intidx1 =num1.length() -1;
5+
intidx2 =num2.length() -1;
6+
intcarry =0;
7+
while (idx1 >=0 ||idx2 >=0) {
8+
inttemp =carry;
9+
if (idx1 >=0 &&idx2 >=0) {
10+
temp +=Character.getNumericValue(num1.charAt(idx1--)) +Character.getNumericValue(num2.charAt(idx2--));
11+
}
12+
elseif (idx1 >=0 &&idx2 <0) {
13+
temp +=Character.getNumericValue(num1.charAt(idx1--));
14+
}
15+
else {
16+
temp +=Character.getNumericValue(num2.charAt(idx2--));
17+
}
18+
carry =temp >9 ?1 :0;
19+
temp =temp >9 ?temp %10 :temp;
20+
sb.append(temp);
3021
}
22+
if (carry >0) {
23+
sb.append(carry);
24+
}
25+
returnsb.reverse().toString();
26+
}
3127
}

‎Easy/Palindrome Number.java

Lines changed: 13 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,17 @@
11
classSolution {
2-
publicbooleanisPalindrome(intx) {
3-
returnx <0 ?false :x ==getReverseDigit(x);
2+
publicbooleanisPalindrome(intx) {
3+
if (x <0) {
4+
returnfalse;
45
}
5-
6-
privateintgetReverseDigit(intx) {
7-
intnum =0;
8-
while (x >0) {
9-
num =num *10 +x %10;
10-
x /=10;
11-
}
12-
13-
returnnum;
6+
returnx -reverse(x) ==0;
7+
}
8+
9+
privateintreverse(intn) {
10+
intnewNum =0;
11+
while (n >0) {
12+
newNum =newNum *10 +n %10;
13+
n /=10;
1414
}
15+
returnnewNum;
16+
}
1517
}

‎Easy/Trim a Binary Search Tree.java

Lines changed: 15 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -8,14 +8,20 @@
88
* }
99
*/
1010
classSolution {
11-
publicTreeNodetrimBST(TreeNoderoot,intL,intR) {
12-
if (root ==null)returnnull;
13-
if (root.val <L)returntrimBST(root.right,L,R);
14-
if (root.val >R)returntrimBST(root.left,L,R);
15-
16-
root.left =trimBST(root.left,L,R);
17-
root.right =trimBST(root.right,L,R);
18-
19-
returnroot;
11+
publicTreeNodetrimBST(TreeNoderoot,intL,intR) {
12+
if (root ==null) {
13+
returnnull;
2014
}
15+
if (root.val <L) {
16+
returntrimBST(root.right,L,R);
17+
}
18+
elseif (root.val >R) {
19+
returntrimBST(root.left,L,R);
20+
}
21+
else {
22+
root.left =trimBST(root.left,L,R);
23+
root.right =trimBST(root.right,L,R);
24+
returnroot;
25+
}
26+
}
2127
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp