-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinCoinChange.java
More file actions
43 lines (33 loc) · 1 KB
/
MinCoinChange.java
File metadata and controls
43 lines (33 loc) · 1 KB
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
32
33
34
35
36
37
38
39
40
41
42
43
package Leetcode;
import java.util.Arrays;
public class MinCoinChange
{
public static int threeSumClosest(int[] nums, int target) {
if(nums==null || nums.length<3)
return 0;
Arrays.sort(nums);
int closestSum=nums[0]+nums[1]+nums[nums.length-1];
for(int i=0;i<nums.length-2;i++)
{
int left=i+1;
int right=nums.length-1;
while(left<right)
{
int sum = nums[i]+nums[left]+nums[right];
if(sum>target)
right--;
else
left++;
if(Math.abs( sum-target )<Math.abs( target - closestSum ))
{
closestSum = sum;
}
}
}
return closestSum;
}
public static void main( String[] args )
{
System.out.println( threeSumClosest( new int[] {-3,-2,-5,3,-4}, -1 ) );
}
}