2345 solved.

liuyubobobo · liuyubobobo · commit f78380b423de · 2022-07-22T12:46:23.000-07:00
diff --git a/2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/CMakeLists.txt b/2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_2345)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_2345 main.cpp)
diff --git a/2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/main.cpp b/2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/main.cpp
@@ -0,0 +1,59 @@
+/// Source : https://leetcode.com/problems/finding-the-number-of-visible-mountains/
+/// Author : liuyubobobo
+/// Time   : 2022-07-22
+
+#include <iostream>
+#include <vector>
+#include <climits>
+
+using namespace std;
+
+
+/// Points Transformation
+/// Time Complexity: O(nlogn)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    int visibleMountains(vector<vector<int>>& peaks) {
+
+        int n = peaks.size();
+
+        vector<pair<int, int>> points(n);
+        for(int i = 0; i < n; i ++){
+            int x = peaks[i][0], y = peaks[i][1];
+            points[i] = {x + y, y - x};
+        }
+
+        sort(points.begin(), points.end(), greater<pair<int, int>>());
+
+        int res = 0, ylimit = INT_MIN;
+        for(int i = 0; i < n; i ++){
+            int x = points[i].first, y = points[i].second;
+
+            if(i + 1 < n && points[i + 1] == points[i]){
+                ylimit = max(ylimit, y);
+                continue;
+            }
+
+            if(i && x == points[i - 1].first) continue;
+
+            if(y > ylimit) res ++;
+            ylimit = max(ylimit, y);
+        }
+        return res;
+    }
+};
+
+
+int main() {
+
+    vector<vector<int>> peaks1 = {{2, 2}, {6, 3}, {5, 4}};
+    cout << Solution().visibleMountains(peaks1) << '\n';
+    // 2
+
+    vector<vector<int>> peaks2 = {{1, 3}, {1, 3}};
+    cout << Solution().visibleMountains(peaks2) << '\n';
+    // 0
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2195,6 +2195,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2342 | [Max Sum of a Pair With Equal Sum of Digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/) | [无] | [C++](2001-2500/2342-Max-Sum-of-a-Pair-With-Equal-Sum-of-Digits/cpp-2342/) | | |
 | 2343 | [Query Kth Smallest Trimmed Number](https://leetcode.com/problems/query-kth-smallest-trimmed-number/) | [无] | [C++](2001-2500/2343-Query-Kth-Smallest-Trimmed-Number/cpp-2343/) | | |
 | 2344 | [Minimum Deletions to Make Array Divisible](https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/) | [无] | [C++](2001-2500/2344-Minimum-Deletions-to-Make-Array-Divisible/cpp-2344/) | | |
+| 2345 | [Finding the Number of Visible Mountains](https://leetcode.com/problems/finding-the-number-of-visible-mountains/) | [无] | [C++](2001-2500/2345-Finding-the-Number-of-Visible-Mountains/cpp-2345/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
