摘要:
题目:https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences/ 题意:将一个排序好的数组分割成多个长度不小于3的连续子序列,例如:输入[1,2,2,3,3,4],有“1,2,3”、“2,3,4”,可以分割; 阅读全文
摘要:
题目:https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/ 代码: class Solution { public int movingCount(int m, int n, int k) { LinkedList< 阅读全文