FilesExpand file tree

 master

/

LeetCode15.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (41 loc) · 1.19 KB

 master

/

LeetCode15.java

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (41 loc) · 1.19 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

import java.util.*;

class LeetCode15{

public static List<List<Integer>> threeSum(int[] nums) {

Arrays.sort(nums);

List<List<Integer>> listlist = new LinkedList<List<Integer>>();

HashSet<List<Integer>> set = new HashSet<List<Integer>>();

/* depends on the set search algorithm efficiency */

for(int i=0;i<nums.length;i++)

{

for(int j=i+1,k=nums.length-1;j<k;)

{

if(nums[i]+nums[j]+nums[k]==0)

{

List<Integer> l= new LinkedList<Integer>();

l.add(nums[i]);

l.add(nums[j]);

l.add(nums[k]);

if(set.add(l))

listlist.add(l);

j++;

k--;

}

else if(nums[i]+nums[j]+nums[k]<0)

j++;

else

k--;

}

}

return listlist;

}

public static void main(String[] args){

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

int[] n2 = {0,-1,3,-2,1,3};

int[] n3 = {0, 0 , 0 , 0};

int[] n4 = {0,0,1,2,3,4,-4,-5,-6};

System.out.println("The result of test 1 is " + threeSum(n1));

System.out.println("The result of test 2 is " + threeSum(n2));

System.out.println("The result of test 3 is " + threeSum(n3));

System.out.println("The result of test 4 is " + threeSum(n4));

}

}