# ---
# title: 354. Russian Doll Envelopes
# id: problem354
# author: Tian Jun
# date: 2020-10-31
# difficulty: Hard
# categories: Binary Search, Dynamic Programming
# link: <https://leetcode.com/problems/russian-doll-envelopes/description/>
# hidden: true
# ---
# 
# You have a number of envelopes with widths and heights given as a pair of
# integers `(w, h)`. One envelope can fit into another if and only if both the
# width and height of one envelope is greater than the width and height of the
# other envelope.
# 
# What is the maximum number of envelopes can you Russian doll? (put one inside
# other)
# 
# **Note:**  
# Rotation is not allowed.
# 
# **Example:**
# 
#     
#     
#     Input: [[5,4],[6,4],[6,7],[2,3]]
#     Output: 3 
#     **Explanation: T** he maximum number of envelopes you can Russian doll is 3 ([2,3] => [5,4] => [6,7]).
#     
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
