Leetcode-文章-Go语言中文社区

0推荐

1165浏览

[LeetCode] 910. Smallest Range II 最小区间之二

Givenanarray A ofintegers,foreachinteger A[i] weneedtochoose either x=-K or x=K,andadd x to A[i] (onlyonce). Afterthisprocess,wehavesomearray B. Returnthesmallestpossibledifferencebetweenthemaximumvalueof B andtheminimumvalueof B. Example1: Input:A=[1],K=

0

0推荐

1514浏览

[LeetCode] 909. Snakes and Ladders 蛇梯棋

OnanNxN board,thenumbersfrom 1 to N*Narewritten boustrophedonically startingfromthebottom leftoftheboard,andalternatingdirectioneachrow. Forexample,fora6x6board,thenumbersarewrittenasfollows: Youstartonsquare 1 oftheboard(whichisalwaysinthelastrowand fir

0

0推荐

1384浏览

[LeetCode] 908. Smallest Range I 最小区间

Givenanarray A ofintegers,foreachinteger A[i] wemaychooseany x with -K<=x<=K,andadd x to A[i]. Afterthisprocess,wehavesomearray B. Returnthesmallestpossibledifferencebetweenthemaximumvalueof B andtheminimumvalueof B. Example1: Input:A=[1],K=0 Output

0

0推荐

1649浏览

[LeetCode] 907. Sum of Subarray Minimums 子数组最小值之和

Givenanarrayofintegers A,findthesumof min(B),where B rangesover every(contiguous)subarrayof A. Sincetheanswermaybelarge, returntheanswermodulo 10^9+7. Example1: Input:[3,1,2,4] Output:17 Explanation:Subarraysare[3],[1],[2],[4],[3,1],[1,2],[2,4],[3,1,2],[1

0

0推荐

1710浏览

[LeetCode] 906. Super Palindromes 超级回文数

Let'ssayapositiveintegerisa superpalindrome ifitisapalindrome,anditisalsothesquareofapalindrome. Now,giventwopositive integers L and R(representedasstrings),returnthenumberofsuperpalindromesintheinclusiverange [L,R]. Example1: Input:L="4",R="1000" Output:

0

0推荐

1167浏览

[LeetCode] 905. Sort Array By Parity 按奇偶排序数组

Givenanarray A ofnon-negativeintegers,returnanarrayconsistingofalltheevenelementsof A,followedbyalltheoddelementsof A. Youmayreturnanyanswerarraythatsatisfiesthiscondition. Example1: Input:[3,1,2,4] Output:[2,4,3,1] Theoutputs[4,2,3,1],[2,4,1,3],and[4,2,1

0

0推荐

1120浏览

[LeetCode] 904. Fruit Into Baskets 水果装入果篮

Inarowoftrees,the i-thtree produces fruitwithtype tree[i]. You startatanytree ofyourchoice,thenrepeatedlyperformthefollowingsteps: Addonepieceoffruitfromthistreetoyourbaskets. Ifyoucannot,stop. Movetothenexttreetotherightofthecurrenttree. Ifthereisnotreet

0

0推荐

1162浏览

[LeetCode] 903. Valid Permutations for DI Sequence DI序列的有效排列

Wearegiven S,alength n stringofcharactersfromtheset {'D','I'}.(Theselettersstandfor"decreasing"and"increasing".) A validpermutation isapermutation P[0],P[1],...,P[n] ofintegers {0,1,...,n},suchthatforall i: If S[i]=='D',then P[i]>P[i+1],and; If S[i]=='

0

0推荐

1682浏览

[LeetCode] 901. Online Stock Span 股票价格跨度

Writeaclass StockSpanner whichcollectsdailypricequotesforsomestock,andreturnsthe span ofthatstock'spriceforthecurrentday. Thespanofthestock'spricetoday isdefinedasthemaximumnumberofconsecutivedays(startingfromtodayandgoingbackwards) forwhichthepriceofthes

0

0推荐

1645浏览

[LeetCode] 900. RLE Iterator RLE迭代器

Writeaniteratorthatiteratesthrougharun-lengthencodedsequence. Theiteratorisinitializedby RLEIterator(int[]A),where A isarun-lengthencodingofsome sequence. Morespecifically, foralleven i, A[i] tellsusthenumberoftimesthatthenon-negativeintegervalue A[i+1] i

0

0推荐

1348浏览

[LeetCode] 899. Orderly Queue 有序队列

Astring S oflowercaselettersisgiven. Then,wemaymakeanynumberof moves. Ineachmove,we chooseone ofthefirst K letters(startingfromtheleft),removeit, andplaceitattheendofthestring. Returnthelexicographicallysmalleststringwecouldhaveafteranynumberofmoves. Exam

0

0推荐

1238浏览

[LeetCode] 898. Bitwise ORs of Subarrays 子数组按位或操作

Wehaveanarray A ofnon-negativeintegers. Forevery(contiguous)subarray B= [A[i],A[i+1],...,A[j]] (with i<=j),wetakethebitwiseORofalltheelementsin B,obtainingaresult A[i]|A[i+1]|...|A[j]. Returnthenumberofpossible results. (Resultsthatoccurmorethanonceare

0

0推荐

1262浏览

[LeetCode] 897. Increasing Order Search Tree 递增顺序查找树

Givenatree,rearrangethetreein in-order sothattheleftmostnodeinthetreeisnowtherootofthetree,andeverynodehasnoleftchildandonly1rightchild. Example1: Input:[5,3,6,2,4,null,8,1,null,null,null,7,9] 5 / 36 /\ 248 // 179 Output:[1,null,2,null,3,null,4,null,5,

0

0推荐

1256浏览

[LeetCode] 896. Monotonic Array 单调数组

Anarrayis monotonic ifitiseithermonotoneincreasingormonotonedecreasing. Anarray A ismonotoneincreasingifforall i<=j, A[i]<=A[j]. Anarray A ismonotonedecreasingifforall i<=j, A[i]>=A[j]. Return true ifandonlyifthegivenarray A ismonotonic. Examp

0

0推荐

1195浏览

[LeetCode] 895. Maximum Frequency Stack 最大频率栈

Implement FreqStack,aclasswhichsimulatestheoperationofastack-likedatastructure. FreqStack hastwofunctions: push(intx),whichpushesaninteger xontothestack. pop(),which removes andreturnsthemostfrequentelementinthestack. Ifthereisatieformostfrequentelement,t

0