LeetCode Weekly Contest 47是LeetCode举办的第五十二场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-47/
题解列表：
LeetCode 665. Non-decreasing Array
档案日期2017的35
2017年8月28日 - 2017年9月3日
LeetCode Weekly Contest 47解题报告
[LeetCode]Kth Smallest Number in Multiplication Table
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 668. Kth Smallest Number in Multiplication Table
Nearly every one have used the Multiplication Table. But could you find out the k-th smallest number quickly from the multiplication table?
Given the height m and the length n of ...
[LeetCode]Beautiful Arrangement II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 667. Beautiful Arrangement II
Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requirement:
Suppose this list is [a1 ...
[LeetCode]Path Sum IV
作者是
发布于
在
LeetCode.
题目描述：
If the depth of a tree is smaller than 5, then this tree can be represented by a list of three-digits integers.
For each integer in this list:
- The hundreds digit represents the depth ...
[LeetCode]Non-decreasing Array
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 665. Non-decreasing Array
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.
We define an array is non-decreasing if array[i] <= array[i + 1 ...