2017年9月5日
LeetCode 209. Minimum Size Subarray Sum （最短子数组之和）
摘要： Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't 阅读全文
posted @ 2017-09-05 11:00 Jimmy_Cheng 阅读(404) 评论(0) 推荐(0)
LeetCode 189. Rotate Array （旋转数组）
摘要： Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. Not 阅读全文
posted @ 2017-09-05 03:55 Jimmy_Cheng 阅读(4279) 评论(0) 推荐(0)