-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtriplets.cpp
69 lines (67 loc) · 1.65 KB
/
triplets.cpp
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
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
//Line 1 -- Array of int
//Line 2 -- Targeted sum of triplets
vector<vector<int>> pairs(vector<int> arr, int target_sum)
{
vector<vector<int>> result;
for (int i = 0; i <= arr.size() - 3; i++)
{
int left_pointer = i + 1;
int right_pointer = arr.size() - 1;
while (left_pointer < right_pointer)
{ int current_sum = arr[i];
current_sum+=arr[left_pointer];
current_sum+=arr[right_pointer];
if (current_sum== target_sum)
{
result.push_back({arr[i],arr[left_pointer],arr[right_pointer]});
right_pointer--;
left_pointer++;
}
if (current_sum > target_sum)
{
right_pointer--;
}
else
{
left_pointer++;
}
}
}
return result ;
}
void vector_traversal(vector<int> arr)
{
for (int i = 0; i < arr.size(); i++)
{
cout << "|" << arr[i] << "|";
}
cout << endl;
}
void vector_traversal_2d(vector<vector<int>> arr)
{
for (int i = 0; i < arr.size() ; i++)
{
for (int j = 0; j < arr[0].size(); j++)
{
cout << "|" << arr[i][j] << "|";
}
cout << endl;
}
cout << endl;
}
int main()
{
vector<int> arr = {4, 5, 2, 7, 3, 6, 15, 9, 1, 8};
sort(arr.begin(), arr.end());
vector_traversal(arr);
int target_sum = 18;
vector<vector <int>> result = pairs(arr, target_sum);
cout<<result.size();
cout<<endl;
vector_traversal_2d(result);
return 0;
}