algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 05:59:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
src/main/java/com/thealgorithms/misc/TwoSumProblem.java
View File

@ -17,14 +17,23 @@ public class TwoSumProblem {
arr[i] = scan.nextInt();
}
TwoSumProblem t = new TwoSumProblem();
System.out.println("Brute Force Approach\n" + Arrays.toString(t.BruteForce(arr, ts)) + "\n");
System.out.println("Two Pointer Approach\n" + Arrays.toString(t.TwoPointer(arr, ts)) + "\n");
System.out.println("Hashmap Approach\n" + Arrays.toString(t.HashMap(arr, ts)));
System.out.println(
"Brute Force Approach\n" +
Arrays.toString(t.BruteForce(arr, ts)) +
"\n"
);
System.out.println(
"Two Pointer Approach\n" +
Arrays.toString(t.TwoPointer(arr, ts)) +
"\n"
);
System.out.println(
"Hashmap Approach\n" + Arrays.toString(t.HashMap(arr, ts))
);
}
public int[] BruteForce(int[] nums, int target) {
//Brute Force Approach
//Brute Force Approach
int ans[] = new int[2];
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
@ -34,7 +43,6 @@ public class TwoSumProblem {
break;
}
}
}
@ -48,21 +56,24 @@ public class TwoSumProblem {
for (int i = 0; i < nums.length; i++) {
hm.put(i, nums[i]);
}
HashMap<Integer, Integer> temp
= hm.entrySet()
.stream()
.sorted((i1, i2)
-> i1.getValue().compareTo(
i2.getValue()))
.collect(Collectors.toMap(
Map.Entry::getKey,
Map.Entry::getValue,
(e1, e2) -> e1, LinkedHashMap::new));
HashMap<Integer, Integer> temp = hm
.entrySet()
.stream()
.sorted((i1, i2) -> i1.getValue().compareTo(i2.getValue()))
.collect(
Collectors.toMap(
Map.Entry::getKey,
Map.Entry::getValue,
(e1, e2) -> e1,
LinkedHashMap::new
)
);
int start = 0;
int end = nums.length - 1;
while (start < end) {
int currSum = (Integer) temp.values().toArray()[start] + (Integer) temp.values().toArray()[end];
int currSum = (Integer) temp.values().toArray()[start] +
(Integer) temp.values().toArray()[end];
if (currSum == target) {
ans[0] = (Integer) temp.keySet().toArray()[start];
@ -73,10 +84,8 @@ public class TwoSumProblem {
} else if (currSum < target) {
start += 1;
}
}
return ans;
}
public int[] HashMap(int[] nums, int target) {
@ -97,5 +106,4 @@ public class TwoSumProblem {
return ans;
}
}