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

Commit16f7fdf

Browse files
refactor 1300
1 parent1091348 commit16f7fdf

File tree

3 files changed

+47
-19
lines changed

3 files changed

+47
-19
lines changed

‎README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -392,7 +392,7 @@ _If you like this project, please leave me a star._ ★
392392
|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java)||Medium||
393393
|1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java)||Easy||
394394
|1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java)||Medium||
395-
|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java)||Medium||
395+
|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java)||Medium|Binary Search, Sorting|
396396
|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java)||Easy||
397397
|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java)||Medium||
398398
|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java)||Medium||

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

Lines changed: 9 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,15 @@ public class _1300 {
44
publicstaticclassSolution1 {
55
publicintfindBestValue(int[]arr,inttarget) {
66
intave =target /arr.length;
7-
intmin =findMin(arr);
8-
intmax =findMax(arr);
7+
intmax =arr[0];
8+
intmin =arr[0];
9+
for (inti =1;i <arr.length;i++) {
10+
min =Math.min(min,arr[i]);
11+
max =Math.max(max,arr[i]);
12+
}
13+
if (ave >=max) {
14+
returnmax;
15+
}
916
//if ave is the best value, what's the difference to target?
1017
intclosetDiff =findClosestDiffIfReplaceWithVal(arr,ave,target);
1118
intbestValue =ave;
@@ -47,20 +54,5 @@ private int findClosestDiffIfReplaceWithVal(int[] arr, int replaceValue, int tar
4754
returnMath.abs(sum -target);
4855
}
4956

50-
privateintfindMax(int[]arr) {
51-
intmax =arr[0];
52-
for (inti =1;i <arr.length;i++) {
53-
max =Math.max(max,arr[i]);
54-
}
55-
returnmax;
56-
}
57-
58-
privateintfindMin(int[]arr) {
59-
intmin =arr[0];
60-
for (inti =1;i <arr.length;i++) {
61-
min =Math.min(min,arr[i]);
62-
}
63-
returnmin;
64-
}
6557
}
6658
}

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

Lines changed: 37 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,4 +33,40 @@ public void test3() {
3333
assertEquals(11361,solution1.findBestValue(arr,56803));
3434
}
3535

36-
}
36+
@Test
37+
publicvoidtest4() {
38+
arr =newint[]{2,3,5};
39+
assertEquals(5,solution1.findBestValue(arr,11));
40+
}
41+
42+
@Test
43+
publicvoidtest5() {
44+
arr =newint[]{60864,25176,27249,21296,20204};
45+
assertEquals(11361,solution1.findBestValue(arr,56803));
46+
}
47+
48+
@Test
49+
publicvoidtest6() {
50+
arr =newint[]{48772,52931,14253,32289,75263};
51+
assertEquals(8175,solution1.findBestValue(arr,40876));
52+
}
53+
54+
@Test
55+
publicvoidtest7() {
56+
arr =newint[]{1547,83230,57084,93444,70879};
57+
assertEquals(17422,solution1.findBestValue(arr,71237));
58+
}
59+
60+
@Test
61+
publicvoidtest8() {
62+
arr =newint[]{1,1,2};
63+
assertEquals(2,solution1.findBestValue(arr,10));
64+
}
65+
66+
@Test
67+
publicvoidtest9() {
68+
arr =newint[]{1,1,1};
69+
assertEquals(1,solution1.findBestValue(arr,10));
70+
}
71+
72+
}

0 commit comments

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