We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 365ec1c commit 0cd0897Copy full SHA for 0cd0897
src/main/java/com/fishercoder/solutions/_16.java
@@ -7,21 +7,13 @@ public class _16 {
7
public static class Solution1 {
8
public int threeSumClosest(int[] nums, int target) {
9
Arrays.sort(nums);
10
- int len = nums.length;
11
- if (len < 3) {
12
- int sum = 0;
13
- for (int i : nums) {
14
- sum += i;
15
- }
16
- return sum;
17
18
int sum = nums[0] + nums[1] + nums[2];
19
- for (int i = 0; i < len - 2; i++) {
+ for (int i = 0; i < nums.length - 2; i++) {
20
int left = i + 1;
21
- int right = len - 1;
+ int right = nums.length - 1;
22
while (left < right) {
23
int thisSum = nums[i] + nums[left] + nums[right];
24
- if (Math.abs(target - thisSum) < Math.abs(target - sum)) {
+ if (Math.abs(thisSum - target) < Math.abs(sum - target)) {
25
sum = thisSum;
26
if (sum == target) {
27
return sum;
0 commit comments