LeetCode Weekly Contest 35是LeetCode举办的第四十场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-35/
题解列表：
LeetCode 605. Can Place Flowers
LeetCode 606. Construct String from Binary Tree
档案日期2017的22
2017年5月29日 - 2017年6月4日
LeetCode Weekly Contest 35解题报告
[LeetCode]Tag Validator
作者是
发布于
在
LeetCode.
题目描述：
Given a string representing a code snippet, you need to implement a tag validator to parse the code and return whether it is valid. A code snippet is valid if all the following rules hold ...
[LeetCode]Find Duplicate File in System
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 609. Find Duplicate File in System
Given a list of directory info including directory path, and all the files with contents in this directory, you need to find out all the groups of duplicate files in the file ...
[LeetCode]Construct String from Binary Tree
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 606. Construct String from Binary Tree
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.
The null node needs to be represented by empty parenthesis pair " ...
[LeetCode]Can Place Flowers
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 605. Can Place Flowers
Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would ...