russian_doll_envelopes

Author: hitzzc

README.md

@@ -251,6 +251,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [347. Top K Frequent Elements](https://github.com/hitzzc/go-leetcode/tree/master/top_k_frequent_elements)
 #### [349. Intersection of Two Arrays](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays)
 #### [350. Intersection of Two Arrays II](https://github.com/hitzzc/go-leetcode/tree/master/intersection_of_two_arrays_II)
+#### [354. Russian Doll Envelopes](https://github.com/hitzzc/go-leetcode/tree/master/russian_doll_envelopes)
 
 
 

russian_doll_envelopes/russian_doll_envelopes.cpp

@@ -0,0 +1,24 @@
+classSolution {
+public:
+intmaxEnvelopes(vector<pair<int, int>>& envelopes) {
+ vector<int> dp;
+sort(envelopes.begin(), envelopes.end(), [](const pair<int, int>& a, const pair<int, int>& b) {
+if (a.first == b.first) return a.second > b.second;
+return a.first < b.first;
+ });
+for (int i = 0; i < envelopes.size(); ++i) {
+int left = 0, right = dp.size();
+while (left < right) {
+int mid = left + (right-left)/2;
+if (dp[mid] < envelopes[i].second) {
+ left = mid+1;
+ }else {
+ right = mid;
+ }
+ }
+if (right >= dp.size()) dp.push_back(envelopes[i].second);
+else dp[right] = envelopes[i].second;
+ }
+return dp.size();
+ }
+};