LeetCode Weekly Contest 49是LeetCode举办的第五十三场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-49/
题解列表：
LeetCode 674. Longest Continuous Increasing Subsequence
LeetCode 676. Implement Magic Dictionary
档案日期2017的36
2017年9月4日 - 2017年9月10日
LeetCode Weekly Contest 49解题报告
[LeetCode]Number of Longest Increasing Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 673. Number of Longest Increasing Subsequence
Given an unsorted array of integers, find the number of longest increasing subsequence.
Example 1:
Input: [1,3,5,4,7] Output: 2 Explanation: The two longest increasing subsequence are [1, 3 ...
[LeetCode]Cut Off Trees for Golf Event
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 675. Cut Off Trees for Golf Event
You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:
0represents theobstaclecan't ...
[LeetCode]Implement Magic Dictionary
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 676. Implement Magic Dictionary
Implement a magic directory with buildDict, and search methods.
For the method buildDict, you'll be given a list of non-repetitive words to build a dictionary.
For the method search, you'll be given a word ...
[LeetCode]Longest Continuous Increasing Subsequence
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 674. Longest Continuous Increasing Subsequence
Given an unsorted array of integers, find the length of longest continuous increasing subsequence.
Example 1:
Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuous increasing subsequence is [1,3 ...