LeetCode Weekly Contest 45是LeetCode举办的第五十场正式周赛，共4道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-45/
题解列表：
LeetCode 657. Judge Route Circle
LeetCode 658. Find K Closest Elements
归档 2017年8月
LeetCode Weekly Contest 45解题报告
[LeetCode]Remove 9
作者是
发布于
在
LeetCode.
题目描述：
Start from integer 1, remove any integer that contains 9 such as 9, 19, 29...
So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, ...
Given ...
[LeetCode]Split Array into Consecutive Subsequences
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 659. Split Array into Consecutive Subsequences
You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers. Return ...
[LeetCode]Find K Closest Elements
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 658. Find K Closest Elements
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie ...
[LeetCode]Judge Route Circle
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 657. Judge Route Circle
Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.
The move sequence ...