分类:全部列表
[LeetCode]164.MaximumGap求最大间距Givenanunsortedarray,findthemaximumdifferencebetweenthesuccessiveelementsinitssortedform.Return0ifthearraycontainslessthan2elements.Example1:Input:[3,6,9,1]Output:3Explanation:Thesortedformofthearrayis[1,3,6,9],either(3,6)or(6,9)hasthemaximumdifference3.Example2:Input:[10]Output:0Explanation:Thearraycontainsles...
继续阅读 >
[LeetCode]228.SummaryRanges总结区间Givenasortedintegerarraywithoutduplicates,returnthesummaryofitsranges.Example1:Input: [0,1,2,4,5,7]Output:["0->2","4->5","7"]Explanation:0,1,2formacontinuousrange; 4,5formacontinuousrange.Example2:Input: [0,2,3,4,6,8,9]Output:["0","2->4","6","8->9"]Explanation:2,3,4formacontinuousrange; 8,9formacontinuous...
继续阅读 >
[LeetCode]163.MissingRanges缺失区间Givenasortedintegerarray nums,wheretherangeofelementsareinthe inclusiverange [lower, upper],returnitsmissingranges.Example:Input:nums=[0,1,3,50,75],lower=0andupper=99,Output:["2","4->49","51->74","76->99"]这道题让我们求缺失区间,跟之前那道 SummaryRanges 很类似,给了一个空间的范围[lowerupper]...
继续阅读 >