# 归档 2017年8月30日

## LeetCode Weekly Contest 47解题报告 作者是 在线疯狂 发布于 2017年8月30日 在 LeetCode.

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

LeetCode 665. Non-decreasing Array

LeetCode 666. Path Sum IV

LeetCode 667. Beautiful Arrangement II

LeetCode 668. Kth Smallest Number in Multiplication Table

## 题目描述：

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 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 666. Path Sum IV

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:

1. The hundreds digit represents the depth ...

## 题目描述：

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