FilesExpand file tree

 master

/

ThreeSumClosest.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

55 lines (51 loc) · 1.51 KB

 master

/

ThreeSumClosest.java

Copy path

Top

File metadata and controls

• Code
• Blame

55 lines (51 loc) · 1.51 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

44

45

46

47

48

49

50

51

52

53

54

55

package two_pointers;

import java.util.Arrays;

/**

* Created by gouthamvidyapradhan on 13/06/2017. Accepted Given an array S of n integers, find three

* integers in S such that the sum is closest to a given number, target. Return the sum of the three

* integers. You may assume that each input would have exactly one solution.

*

* <p>For example, given array S = {-1 2 1 -4}, and target = 1.

*

* <p>The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

*/

public class ThreeSumClosest {

public static void main(String[] args) {

int[] a = {-1, 2, 1, -4};

System.out.println(new ThreeSumClosest().threeSumClosest(a, 1));

}

public int threeSumClosest(int[] a, int target) {

Arrays.sort(a);

int min = Integer.MAX_VALUE, ans = -1;

for (int i = 0, l = a.length; i < l - 2; i++) {

if (i == 0 || !(a[i] == a[i - 1])) {

int j = i + 1, k = l - 1;

while (k > j) {

if (j != i + 1 && (a[j] == a[j - 1])) {

j++;

continue;

}

int sum = a[i] + a[j] + a[k];

if (sum < target) {

int diff = Math.abs(sum - target);

if (diff < min) {

min = diff;

ans = sum;

}

j++;

} else if (sum > target) {

int diff = Math.abs(sum - target);

if (diff < min) {

min = diff;

ans = sum;

}

k--;

} else {

return sum;

}

}

}

}

return ans;

}

}