FilesExpand file tree

 master

/

3SumClosest.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

38 lines (36 loc) · 1.24 KB

 master

/

3SumClosest.java

Top

File metadata and controls

• Code
• Blame

38 lines (36 loc) · 1.24 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

/*

Author: King, wangjingui@outlook.com

Date: Dec 20, 2014

Problem: 3Sum Closest

Difficulty: Medium

Source: https://oj.leetcode.com/problems/3sum-closest/

Notes:

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.

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

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

Solution: Similar to 3Sum, taking O(n^2) time complexity.

*/

public class Solution {

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

int N = num.length;

if (N < 3) return 0;

int res = num[0] + num[1] + num[2];

Arrays.sort(num);

for (int i = 0; i < N-2; ++i)

{

int l = i + 1, r = N - 1;

while (l < r)

{

int threesum = num[i] + num[l] + num[r];

if (threesum == target) return target;

else if (threesum < target) ++l;

else --r;

if (Math.abs(threesum - target) < Math.abs(res - target))

res = threesum;

}

}

return res;

}

}