2017年7月14日
[Leetcode] minimum window substring 最小字符窗口
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S ="ADOBECODE 阅读全文
posted @ 2017-07-14 21:05 王大咩的图书馆 阅读(301) 评论(0) 推荐(1) 编辑
[Leetcode] maximun subarray 最大子数组
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array[−2,1,−3,4,−1,2,1 阅读全文
posted @ 2017-07-14 16:11 王大咩的图书馆 阅读(387) 评论(0) 推荐(0) 编辑
[Leetcode] jump game ii 跳跃游戏
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-07-14 15:34 王大咩的图书馆 阅读(774) 评论(0) 推荐(0) 编辑
[Leetcode] jump game 跳跃游戏
摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2017-07-14 10:49 王大咩的图书馆 阅读(328) 评论(0) 推荐(0) 编辑