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

0推荐

1024浏览

[LeetCode] 1. Two Sum

 1classSolution: 2deftwoSum(self,nums:List[int],target:int)->List[int]: 3foriinrange(len(nums)): 4if(target-nums[i])innumsandi!=nums.index(target-nums[i]): 5return[i,nums.index(target-nums[i])] 

0

0推荐

1276浏览

LeetCode 刷题笔记 1. 两数之和（Two Sum）

tag:栈（stack）题目描述给定一个整数数组nums和一个目标值target，请你在该数组中找出和为目标值的那两个整数，并返回他们的数组下标。你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。示例: 给定nums=[2,7,11,15],target=9 因为nums[0]+nums[1]=2+7=9 所以返回[0,1] python3版本： classSolution: deftwoSum(self,nums,target): """ :typenums:Lis

0

0推荐

1502浏览

LeetCode_32

题目描述：给定一个只包含'(' 和')' 的字符串，找出最长的包含有效括号的子串的长度。示例 1: 输入:"(()" 输出:2 解释:最长有效括号子串为"()" 示例2: 输入:")()())" 输出:4 解释:最长有效括号子串为"()()" 本题还有一个前置题目，详细内容可以点击此链接跳转LeetCode_20，解决方案可以查看我的这篇CSDN博客Li-Richard 稍微有点算法基础的同学看到本题时，脑海里第一个想法应该是使用

0

0推荐

1681浏览

【Leetcode 做题学算法周刊】第一期

首发于微信公众号《前端成长记》，写于2019.10.28 背景本文记录刷题过程中的整个思考过程，以供参考。主要内容涵盖：题目分析设想编写代码验证查阅他人解法思考总结目录 1.两数之和 7.整数反转 9.回文数 13.罗马数字转整数 14.最长公共前缀 Easy 1.两数之和题目地址题目描述给定一个整数数组nums和一个目标值target，请你在该数组中找出和为目标值的那两个整数，并返回

0

0推荐

1250浏览

leetcode求峰值，js实现

原题：    最开始是照着提示的思路进行，中规中矩，用时64ms  /** *@param{number[]}nums *@return{number} */var findPeakElement= function(nums){　　　　leti=0;　　letj=nums.length-1;　　letnums[-1]=nums[0]-1;　　letnums[nums.length]=nums[nums.length-1]-1;

0

0推荐

2058浏览

LeetCode All in One 题目讲解汇总(持续更新中...)

 终于将LeetCode的大部分题刷完了，真是漫长的第一遍啊，估计很多题都忘的差不多了，这次开个题目汇总贴，并附上每道题目的解题连接，方便之后查阅吧~ 对应的 Github项目的同步地址如下，欢迎大家关注点赞❤️ https://github.com/grandyang/leetcode 如果各位看官们，大神们发现了任何错误，或是代码无法通过OJ，或是有更好的解法，或是有任何疑问，意见和建议的话

0

0推荐

1329浏览

[LeetCode] 919. Complete Binary Tree Inserter 完全二叉树插入器

A complete binarytreeisabinarytreeinwhicheverylevel,exceptpossiblythelast,iscompletelyfilled,andallnodesareasfarleftaspossible. Writeadatastructure CBTInserter thatisinitializedwithacompletebinarytreeandsupportsthefollowingoperations: CBTInserter(TreeNode

0

0推荐

1400浏览

[LeetCode] 918. Maximum Sum Circular Subarray 环形子数组的最大和

Givena circular array C ofintegersrepresentedby A,findthemaximumpossiblesumofanon-emptysubarrayof C. Here,a circular array meanstheendofthearrayconnectstothebeginningofthearray. (Formally, C[i]=A[i] when 0<=i<A.length,and C[i+A.length]=C[i] when i&g

0

0推荐

1577浏览

[LeetCode] 917. Reverse Only Letters 只翻转字母

Givenastring S,returnthe"reversed"stringwhereallcharactersthatarenotaletter stayinthesameplace,andalllettersreversetheirpositions. Example1: Input:"ab-cd" Output:"dc-ba" Example2: Input:"a-bC-dEf-ghIj" Output:"j-Ih-gfE-dCba" Example3: Input:"Test1ng-Leet=

0

0推荐

1395浏览

[LeetCode] 916. Word Subsets 单词子集合

Wearegiventwoarrays A and B ofwords. Eachwordisastringoflowercaseletters. Now,saythat word b isasubsetofword a ifeveryletterin b occursin a, includingmultiplicity. Forexample, "wrr" isasubsetof "warrior",butisnotasubsetof "world". Nowsayaword a from A is

0

0推荐

1246浏览

[LeetCode] 915. Partition Array into Disjoint Intervals 分割数组为不相交的区间

Givenanarray A,partitionit intotwo(contiguous)subarrays left and right sothat: Everyelementin left islessthanorequaltoeveryelementin right. left and right arenon-empty. left hasthesmallestpossiblesize. Returnthe length of left aftersuchapartitioning. Itis

0

0推荐

1360浏览

[LeetCode] 914. X of a Kind in a Deck of Cards 一副牌中的X

Inadeckofcards,eachcardhasanintegerwrittenonit. Return true ifandonlyifyoucanchoose X>=2 suchthat itispossibletosplittheentiredeck into1ormoregroupsofcards,where: Eachgrouphasexactly X cards. Allthecardsineachgrouphavethesameinteger. Example1: Input:[1

0

0推荐

1351浏览

[LeetCode] 913. Cat and Mouse 猫和老鼠

Agameonan undirected graphisplayedbytwoplayers,MouseandCat,whoalternateturns. Thegraphisgivenasfollows: graph[a] isalistofallnodes b suchthat ab isanedgeofthegraph. Mousestartsatnode1andgoesfirst,Catstartsatnode2andgoessecond,andthereisaHoleatnode0. Durin

0

0推荐

1537浏览

[LeetCode] 912. Sort an Array 数组排序

Givenanarrayofintegers nums,sortthearrayinascendingorder. Example1: Input: [5,2,3,1] Output:[1,2,3,5] Example2: Input:[5,1,1,2,0,0] Output:[0,0,1,1,2,5] Note: 1<=A.length<=10000 -50000<=A[i]<=50000 这道题让我们给数组排序，在平时刷其他题的时候，遇到要排序的时候，一般都会调用系统自带的排

0

0推荐

1290浏览

[LeetCode] 911. Online Election 在线选举

Inanelection,the i-th votewascastfor persons[i] attime times[i]. Now,wewouldliketoimplementthefollowingqueryfunction: TopVotedCandidate.q(intt) willreturnthenumberofthepersonthatwasleadingtheelectionattime t. Votescastattime t willcounttowardsourquery.

0