# 归档 2017年9月10日

## LeetCode Weekly Contest 49解题报告 作者是 在线疯狂 发布于 2017年9月10日 在 LeetCode.

LeetCode Weekly Contest 49是LeetCode举办的第五十三场正式周赛，共4道题目，比赛时长1.5小时。

LeetCode 674. Longest Continuous Increasing Subsequence

LeetCode 676. Implement Magic Dictionary

LeetCode 675. Cut Off Trees for Golf Event

LeetCode 673. Number of Longest Increasing Subsequence

## 题目描述：

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 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:

1. `0` represents the `obstacle` can't ...

## 题目描述：

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 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 ...```