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

0推荐

1399浏览

[LeetCode] 860. Lemonade Change 买柠檬找零

Atalemonadestand,eachlemonadecosts $5. Customersarestandinginaqueuetobuyfromyou,andorderoneatatime(intheorderspecifiedby bills). Eachcustomerwillonlybuyonelemonadeand paywitheithera $5, $10,or $20 bill. Youmustprovidethecorrectchangetoeachcustomer,sothat

0

0推荐

1501浏览

[LeetCode] 859. Buddy Strings 伙计字符串

Giventwostrings A and B oflowercaseletters,return true ifandonlyifwe canswaptwolettersin A sothattheresultequals B. Example1: Input:A="ab",B="ba" Output:true Example2: Input:A="ab",B="ab" Output:false Example3: Input:A="aa",B="aa" Output:true Example4: In

0

0推荐

1365浏览

[LeetCode] 858. Mirror Reflection 镜面反射

Thereis aspecialsquareroomwithmirrorsoneachofthefour walls. Exceptforthesouthwest corner,therearereceptorsoneachoftheremainingcorners,numbered 0, 1,and 2. Thesquareroomhaswallsoflength p,andalaserrayfromthesouthwestcorner firstmeetstheeastwallatadistance

0

0推荐

1243浏览

[LeetCode] 857. Minimum Cost to Hire K Workers 雇佣K名工人的最低成本

Thereare N workers. The i-thworkerhasa quality[i] andaminimumwageexpectation wage[i]. Nowwewanttohireexactly K workerstoforma paidgroup. WhenhiringagroupofKworkers,wemustpaythemaccordingtothefollowingrules: Everyworkerinthepaidgroupshouldbepaidintheratioo

0

0推荐

1485浏览

[LeetCode] 856. Score of Parentheses 括号的分数

Givenabalancedparenthesesstring S,computethescoreofthestringbasedonthefollowingrule: () hasscore1 AB hasscore A+B,whereAandBarebalancedparenthesesstrings. (A) hasscore 2*A,whereAisabalancedparenthesesstring. Example1: Input:"()" Output:1 Example2: Input:"

0

0推荐

1211浏览

[LeetCode] 855. Exam Room 考试房间

Inanexamroom,thereare N seatsinasinglerow,numbered 0,1,2,...,N-1. Whenastudententerstheroom,theymustsitintheseatthatmaximizesthedistancetotheclosestperson. Iftherearemultiplesuchseats,theysitintheseatwiththelowestnumber. (Also,ifnooneisintheroom,thenthest

0

0推荐

1551浏览

[LeetCode] 854. K-Similar Strings 相似度为K的字符串

Strings A and B are K-similar(forsomenon-negativeinteger K)ifwecanswapthepositionsoftwolettersin A exactly K timessothattheresultingstringequals B. Giventwoanagrams A and B,returnthesmallest K forwhich A and B are K-similar. Example1: Input:A="ab",B="ba"

0

0推荐

1308浏览

[LeetCode] 853. Car Fleet 车队

N carsaregoingtothesamedestinationalongaonelaneroad. Thedestinationis target milesaway. Eachcar i hasaconstantspeed speed[i] (inmilesperhour),andinitialposition position[i] milestowardsthetargetalongtheroad. Acarcanneverpassanothercaraheadofit,butitcancat

0

0推荐

1393浏览

[LeetCode] 852. Peak Index in a Mountain Array 山形数组的顶峰坐标

Let'scallanarray A a mountain ifthefollowingpropertieshold: A.length>=3 Thereexistssome 0<i <A.length-1 suchthat A[0]<A[1]<...A[i-1]<A[i]>A[i+1]>...>A[A.length-1] Givenanarraythatisdefinitelyamountain,returnany i suchthat A[0]&l

0

0推荐

1195浏览

[LeetCode] 851. Loud and Rich 聒噪与富有

InagroupofNpeople(labelled 0,1,2,...,N-1),eachpersonhasdifferentamountsofmoney,anddifferentlevelsofquietness. Forconvenience,we'llcallthepersonwithlabel x,simply"person x". We'llsaythat richer[i]=[x,y] ifperson x definitelyhasmoremoneythanperson y. Noteth

0

0推荐

1751浏览

[LeetCode] 850. Rectangle Area II 矩形面积之二

Wearegivenalistof(axis-aligned) rectangles. Each rectangle[i]=[x1,y1,x2,y2] ,where(x1,y1)arethecoordinatesofthebottom-leftcorner,and(x2,y2)arethecoordinatesofthetop-rightcornerofthe ithrectangle. Findthetotalareacoveredbyall rectangles intheplane. Sinceth

0

0推荐

1466浏览

[LeetCode] 849. Maximize Distance to Closest Person 离最近的人的最大距离

Inarowof seats, 1 representsapersonsittinginthatseat,and 0 representsthattheseatisempty. Thereisatleastoneemptyseat,andatleastonepersonsitting. Alexwantstositintheseatsuchthatthedistancebetweenhimandtheclosestpersontohimismaximized. Returnthatmaximumdis

0

0推荐

1873浏览

[LeetCode] 848. Shifting Letters 漂移字母

 Wehaveastring S oflowercaseletters,andanintegerarray shifts. Callthe shift ofaletter,thenextletterinthealphabet,(wrappingaroundsothat 'z' becomes 'a').  Forexample, shift('a')='b', shift('t')='u',and shift('z')='a'. Nowforeach shifts

0

0推荐

1359浏览

[LeetCode] 847. Shortest Path Visiting All Nodes 访问所有结点的最短路径

Anundirected,connectedgraphofNnodes(labeled 0,1,2,...,N-1)isgivenas graph. graph.length=N,and j!=i isinthelist graph[i] exactlyonce,ifandonlyifnodes i and j areconnected. Returnthelengthoftheshortestpaththatvisitseverynode.Youmaystartandstopatanynode,youm

0

0推荐

2031浏览

[LeetCode] 846. Hand of Straights 一手顺子牌

 Alicehasa hand ofcards,givenasanarrayofintegers. Nowshewantstorearrangethecardsintogroupssothateachgroupissize W,andconsistsof W consecutivecards. Return true ifandonlyifshecan.  Example1: Input:hand=[1,2,3,6,2,3,4,7,8],W=

0