Difficulty:Medium

Difficulty:Hard

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestsum.

Findthecontiguoussubarraywithinanarray(containingatleastonenumber)whichhasthelargestproduct.

Difficulty:Hard

Givenanarrayofintegers,findtwonumberssuchthattheyadduptoaspecifictargetnumber.

Difficulty:Hard

Apeakelementisanelementthatisgreaterthanitsneighbors.

Supposeasortedarrayisrotatedatsomepivotunknowntoyoubeforehand.

给定一个长度为n的数组:int[]nums其中有一个数，它出现的次数大于n/2，称为主要元素，找到它。看起来不算是个难题，但好玩。这是一个投票问题，可以模拟我们在投票表决时的计票过程。用一个hashtable或者dictionary，数组中的数作为key，它们出现的次数为value。本文想讨论的是下…

Difficulty:Medium

Difficulty:Medium

Givenasequenceofintegers,findthelongestincreasingsubsequence(LIS).

给定一个整数序列，找到最长上升子序列（LIS），返回LIS的长度。

Numberskeepcoming,returnthemedianofnumbersateverytimeanewnumberadded.

Apeakelementisanelementthatisgreaterthanitsneighbors.

Givenanarraynums,thereisaslidingwindowofsizekwhichismovingfromtheveryleftofthearraytotheveryright.Youcanonlyseetheknumbersinthewindow.Eachtimetheslidingwindowmovesrightbyoneposition.

Apeakelementisanelementthatisgreaterthanitsneighbors.

Givenanunsortedarraynums,reorderitin-placesuchthatnums[0]=nums[1]=nums[2]=nums[3]....

Givenasortedintegerarraywithoutduplicates,returnthesummaryofitsranges.

Givenanarraywithnobjectscoloredred,whiteorblue,sortthemsothatobjectsofthesamecolorareadjacent,withthecolorsintheorderred,whiteandblue.

Givenanarraynums,thereisaslidingwindowofsizekwhichismovingfromtheveryleftofthearraytotheveryright.Youcanonlyseetheknumbersinthewindow.Eachtimetheslidingwindowmovesrightbyoneposition.

Givenanarrayofnumbersnums,inwhichexactlytwoelementsappearonlyonceandalltheotherelementsappearexactlytwice.Findthetwoelementsthatappearonlyonce.

时间O(logN)空间O(1)

Supposeasortedarrayisrotatedatsomepivotunknowntoyoubeforehand.

Givenasortedarrayofintegers,findthestartingandendingpositionofagiventargetvalue.

Rotateanarrayofnelementstotherightbyksteps.

Givenasortedarray,removetheduplicatesinplacesuchthateachelementappearonlyonceandreturnthenewlength.

Givenanarrayofnintegerswheren1,nums,returnanarrayoutputsuchthatoutput[i]isequaltotheproductofalltheelementsofnumsexceptnums[i].

时间O(N)空间O(N)递归栈