FilesExpand file tree

 master

/

IntersectionOfThreeSets.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

40 lines (32 loc) · 1.14 KB

 master

/

IntersectionOfThreeSets.java

Top

File metadata and controls

• Code
• Blame

40 lines (32 loc) · 1.14 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

package Algorithms;

import java.util.HashMap;

import java.util.LinkedList;

public class IntersectionOfThreeSets {

public static LinkedList<Integer> findIntersection(int[] set1, int[] set2, int[] set3) {

LinkedList<Integer> result = new LinkedList<Integer>();

HashMap<Integer, Integer> tmp = new HashMap<Integer, Integer>();

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

tmp.put(set1[i],1);

}

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

Integer re = tmp.get(set2[i]);

if (re != null) {

tmp.put(set2[i],2);

}

}

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

Integer re = tmp.get(set3[i]);

if (re != null && re == 2) {

result.add(set3[i]);

}

}

return result;

}

public static void main(String[] args) {

int[] a1 = {1,2,20,3,8,9};

int[] a2 = {1,2,3,7,20,9};

int[] a3 = {4,3,90,8,20,9};

LinkedList<Integer> re = IntersectionOfThreeSets.findIntersection(a1,a2,a3);

System.out.printf(re.toString());

}

}