-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathProblem-2.java
109 lines (86 loc) · 2.98 KB
/
Problem-2.java
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/**
* @author AkashGoyal
*/
/**
--------------------- Problem----------->> find four elements that sum to a given value
Problem Link :- https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1
Reference Link :- https://www.youtube.com/watch?v=4ggF3tXIAp0
*/
class Solution {
public ArrayList<ArrayList<Integer>> fourSum(int[] arr, int k) {
// code here
ArrayList<ArrayList<Integer>> result= new ArrayList<ArrayList<Integer>>();
Arrays.sort(arr);
//2 2 3 3 3 5 5 6 7
for(int i=0;i<arr.length-3;i++)
{
for(int j=i+1;j<arr.length-2;j++)
{
int left=j+1;
int right=arr.length-1;
while(left<right)
{
ArrayList<Integer> alist=new ArrayList<>();
int sum=arr[i]+arr[j]+arr[left]+arr[right];
if(sum<k)
{
while(left<right && arr[left]==arr[left+1])
{
left++;
}
left++;
}
else if(sum>k)
{
while(right>left && arr[right]==arr[right-1])
{
right--;
}
right--;
}
else
{
alist.add(arr[i]);
alist.add(arr[j]);
alist.add(arr[left]);
alist.add(arr[right]);
result.add(alist);
while(right>left && arr[right]==arr[right-1])
{
right--;
}
right--;
while(left<right && arr[left]==arr[left+1])
{
left++;
}
left++;
}
}
while(j<arr.length-3)
{
if(arr[j]==arr[j+1])
{
j++;
}
else
{
break;
}
}
}
while(arr.length>4 && i<arr.length-4)
{
if(arr[i]==arr[i+1])
{
i++;
}
else
{
break;
}
}
}
return result;
}
}