diff options
| author | Mohammad S Anwar <Mohammad.Anwar@yahoo.com> | 2021-08-28 18:06:01 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-08-28 18:06:01 +0100 |
| commit | d47e12f36aede87c7b4975f8afc8c07b2b91337d (patch) | |
| tree | 36bbc38deee93d3ab6ac6051823b22ad3cab7d43 | |
| parent | 1dc8a4e1c98379716eaa2afa45ed5efaf4a17541 (diff) | |
| parent | f6baa17b765e44400e8aa90cfb1984266a32fabd (diff) | |
| download | perlweeklychallenge-club-d47e12f36aede87c7b4975f8afc8c07b2b91337d.tar.gz perlweeklychallenge-club-d47e12f36aede87c7b4975f8afc8c07b2b91337d.tar.bz2 perlweeklychallenge-club-d47e12f36aede87c7b4975f8afc8c07b2b91337d.zip | |
Merge pull request #4798 from ziameraj16/ziameraj16-challenge-127
Java solution for Disjoint Sets
| -rw-r--r-- | challenge-127/ziameraj16/README.md | 24 | ||||
| -rw-r--r-- | challenge-127/ziameraj16/java/DisjointSets.java | 23 |
2 files changed, 39 insertions, 8 deletions
diff --git a/challenge-127/ziameraj16/README.md b/challenge-127/ziameraj16/README.md index 90795db3f7..d374d250e5 100644 --- a/challenge-127/ziameraj16/README.md +++ b/challenge-127/ziameraj16/README.md @@ -1,19 +1,27 @@ -# Count Numbers +# Disjoint Sets ## Java Solution To compile the code run ```java -javac CountNumbers.java +javac DisjointSets.java ``` To run ```java -java CountNumbers +java DisjointSets ``` ### Example ```bash -/perlweeklychallenge-club/challenge-126/ziameraj16/java$ javac CountNumbers.java -/perlweeklychallenge-club/challenge-126/ziameraj16/java$ java CountNumbers -Enter the number -15 -8 +/perlweeklychallenge-club/challenge-127/ziameraj16/java$ javac DisjointSets.java +/perlweeklychallenge-club/challenge-127/ziameraj16/java$ java DisjointSets +Enter comma separated list of numbers for that first set +1,2,5,3,4 +Enter comma separate list of numbers for the second set +4,6,7,8,9 +0 +/perlweeklychallenge-club/challenge-127/ziameraj16/java$ java DisjointSets +Enter comma separated list of numbers for that first set +1,3,5,7,9 +Enter comma separate list of numbers for the second set +0,2,4,6,8 +1 ``` diff --git a/challenge-127/ziameraj16/java/DisjointSets.java b/challenge-127/ziameraj16/java/DisjointSets.java new file mode 100644 index 0000000000..3f74a64e5c --- /dev/null +++ b/challenge-127/ziameraj16/java/DisjointSets.java @@ -0,0 +1,23 @@ +import java.util.Arrays; +import java.util.Collections; +import java.util.List; +import java.util.Scanner; +import java.util.stream.Collectors; + +public class DisjointSets { + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + System.out.println("Enter comma separated list of numbers for that first set"); + String[] arr1 = scanner.nextLine().split(","); + List<Integer> list1 = Arrays.stream(arr1).map(Integer::valueOf).collect(Collectors.toList()); + System.out.println("Enter comma separate list of numbers for the second set"); + String[] arr2 = scanner.nextLine().split(","); + List<Integer> list2 = Arrays.stream(arr2).map(Integer::valueOf).collect(Collectors.toList()); + System.out.println(areDisjointSets(list1,list2)); + } + + private static int areDisjointSets(List<Integer> first, List<Integer> second) { + return Collections.disjoint(first, second) ? 1 : 0; + } +} |
