LeetCode贪心算法
文章平均质量分 76
BoomHusky
计算机专业硕士,希望自己的实力能够更强
展开
-
LeetCode | 76. Minimum Window Substring多区域覆盖难题
Given a string S and a string T, find the minimum window in Swhich will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BANC".No原创 2018-01-26 12:42:16 · 184 阅读 · 0 评论 -
LeetCode | 632. Smallest Range求多个数组拥有最小范围的一个交集难题
Youhave k lists of sorted integers in ascending order. Find the smallest rangethat includes at least one number from each of thek lists.Wedefine the range [a,b] is smaller than range [c,d] if b-a原创 2018-01-26 12:43:10 · 594 阅读 · 1 评论 -
LeetCode | 45. Jump Game IIDP或贪心难题
Given an array of non-negative integers, you are initiallypositioned at the first index of the array.Each element in the array represents your maximum jump length atthat position.Your goal is to r原创 2018-01-26 12:54:42 · 231 阅读 · 0 评论 -
LeetCode | 763. Partition Labels 中等偏难贪心算法 把一个字符串划分为有独立字母的最多组的划分方法
Astring S of lowercase letters is given. We want to partition thisstring into as many parts as possible so that each letter appears in at mostone part, and return a list of integers representing the s原创 2018-01-18 17:55:04 · 2530 阅读 · 0 评论 -
LeetCode | 769. Max Chunks To Make Sorted将数组划分成多个部分贪心算法
Givenan array arr that is a permutation of [0, 1, ...,arr.length - 1], we split the array into some numberof "chunks" (partitions), and individually sort each chunk. After concatenating them, the re原创 2018-02-04 15:30:18 · 288 阅读 · 0 评论 -
LeetCode | 30. Substring with Concatenation of All Words字符串技巧难题
You are given a string, s,and a list of words, words,that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each wordin words exactly once and wit原创 2018-02-04 15:32:36 · 172 阅读 · 0 评论 -
LeetCode | 27. Remove Element贪心算法循环技巧题
Givenan array and a value, remove all instances of that value in-place andreturn the new length.Donot allocate extra space for another array, you must do this by modifying the input array in-place原创 2018-02-04 15:38:59 · 148 阅读 · 0 评论 -
LeetCode | 55. Jump Game循环技巧题
Given an array of non-negative integers, you are initiallypositioned at the first index of the array.Each element in the array represents your maximum jump length atthat position.Determine if you原创 2018-01-30 16:47:50 · 135 阅读 · 0 评论