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

Commit06f3863

Browse files
refactor 35 to log(n) solution
1 parenta19e7c7 commit06f3863

File tree

2 files changed

+17
-5
lines changed

2 files changed

+17
-5
lines changed

‎src/main/java/com/fishercoder/solutions/_35.java

Lines changed: 11 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -4,13 +4,19 @@ public class _35 {
44

55
publicstaticclassSolution1 {
66
publicintsearchInsert(int[]nums,inttarget) {
7-
intlen =nums.length;
8-
for (inti =0;i <len;i++) {
9-
if (target <=nums[i]) {
10-
returni;
7+
intleft =0;
8+
intright =nums.length -1;
9+
while (left <right) {
10+
intmid =left + (right -left) /2;
11+
if (nums[mid] ==target) {
12+
returnmid;
13+
}elseif (nums[mid] <target) {
14+
left =mid +1;
15+
}else {
16+
right =mid -1;
1117
}
1218
}
13-
returnlen;
19+
returnnums[left] >=target ?left :left +1;
1420
}
1521
}
1622

‎src/test/java/com/fishercoder/_35Test.java

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,4 +20,10 @@ public void test1() {
2020
nums =newint[]{1,3,5,6};
2121
assertEquals(2,solution1.searchInsert(nums,5));
2222
}
23+
24+
@Test
25+
publicvoidtest2() {
26+
nums =newint[]{1};
27+
assertEquals(0,solution1.searchInsert(nums,1));
28+
}
2329
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp