-
Notifications
You must be signed in to change notification settings - Fork 6
/
1814.cpp
54 lines (41 loc) · 1.26 KB
/
1814.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
//Solution 1 :-
class Solution {
public:
int countNicePairs(std::vector<int>& nums) {
std::unordered_map<long long, int> map;
int count{0};
for(long long val : nums){
std::string str = std::to_string(val);
std::reverse(str.begin(), str.end());
long long rev = std::stoi(str);
val = val - rev;
if(map.find(val) != map.end())
count = (count + map[val]) % int(1e9+7);
map[val]++;
}
return count;
}
};
//Solution 2 :-
class Solution {
public:
int countNicePairs(vector<int>& nums) {
long long result = 0;
unordered_map<long long, int> map1;
for(int i=0; i<nums.size(); i++){
long long ans = (long long)nums[i] - reverseInt(nums[i]);
if(map1.find(ans) != map1.end())
result = result + map1[ans];
map1[ans]++;
}
return (result % 1000000007);
}
long long reverseInt(int num){
long long result = 0;
while(num){
result = (result * 10) + (num % 10);
num = num / 10;
}
return result;
}
};