摘要: Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i.e. subarray). The subsequence must be  阅读全文
posted @ 2020-07-18 17:44 CNoodle 阅读(167) 评论(0) 推荐(0)
摘要: Given an integer array nums and an integer k, return the maximum length of a subarray that sums to k. If there is not one, return 0 instead. Example 1 阅读全文
posted @ 2020-07-18 05:10 CNoodle 阅读(284) 评论(0) 推荐(0)
摘要: You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where f 阅读全文
posted @ 2020-07-18 03:01 CNoodle 阅读(170) 评论(0) 推荐(0)