leetcode刷题
为了找工作通过笔试,前期就是刷leetcode+剑指offer
渣渣琪
菜鸟成长记
展开
-
Leet Code OJ 22. Generate Parentheses-python
题目:22.Generate ParenthesesMedium5731287Add to ListShareGivennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:[ "((()))", "(()())", "(())()", ...原创 2020-09-01 20:14:58 · 337 阅读 · 0 评论 -
Leet Code OJ 13. Roman to Integer-python
题目:13.Roman to IntegerEasy24273630Add to ListShareRoman numerals are represented by seven different symbols:I,V,X,L,C,DandM.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2020-09-01 18:57:25 · 327 阅读 · 0 评论 -
Leet Code OJ 12. Integer to Roman -python
题目:12.Integer to RomanMediumRoman numerals are represented by seven different symbols:I,V,X,L,C,DandM.Symbol ValueI 1V 5X 10L 50C 100D 500M 1...原创 2020-08-31 22:01:40 · 257 阅读 · 0 评论 -
Leet Code OJ 2. Add Two Numbers [Difficulty: Medium] -python
题目:2.Add Two NumbersMediumYou are given twonon-emptylinked lists representing two non-negative integers. The digits are stored inreverse orderand each of their nodes contain a single digit. Add the two numbers and return it as a linked list.Yo...原创 2020-08-30 23:02:49 · 188 阅读 · 0 评论 -
Leet Code OJ 127. Word Ladder [Difficulty: Medium]-python
题目:127.Word LadderMediumGiven two words (beginWordandendWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWordtoendWord, such that:Only one letter can be changed at a time. Each transformed wor...原创 2020-08-30 16:05:48 · 198 阅读 · 0 评论 -
Leet Code OJ 125. Valid Palindrome [Difficulty: Easy] -python
题目:125.Valid PalindromeEasyGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.Note:For the purpose of this problem, we define empty string as valid palindrome.Example 1:Input: "A man,..原创 2020-08-29 21:44:41 · 173 阅读 · 0 评论 -
Leet Code OJ 98. Validate Binary Search Tree [Difficulty: Medium] -python
题目:98.Validate Binary Search TreeMediumGiven a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keysless thanthe node's key. The right subt...原创 2020-08-29 20:59:16 · 174 阅读 · 0 评论 -
Leet Code OJ 88. Merge Sorted Array [Difficulty: Easy] -python
题目:88.Merge Sorted ArrayEasyGiven two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.Note:The number of elements initialized innums1andnums2aremandnrespectively. You may assume thatnums1has enough sp...原创 2020-08-29 20:02:41 · 214 阅读 · 0 评论 -
Leet Code OJ 73. Set Matrix Zeroes [Difficulty: Medium] -python
题目73.Set Matrix ZeroesGiven anmxnmatrix. If an element is0, set its entire row and column to0. Do itin-place.Follow up:A straight forward solution using O(mn) space is probably a bad idea. A simple improvement uses O(m+n) space, but stil...原创 2020-08-29 19:12:55 · 126 阅读 · 0 评论 -
Leet Code OJ 70. Climbing Stairs [Difficulty: Easy] -python
爬楼梯问题:70.Climbing StairsEasyYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Example 1:Input: 2Output: 2Explanation: There ar...原创 2020-08-28 17:21:18 · 195 阅读 · 0 评论 -
Leet Code OJ 65. Valid Number [Difficulty: Hard]-Python
65.Valid NumberHardValidate if a given string can be interpreted asa decimal number.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>true" -90e3 "=>true" 1e"=>false"e3"=>false" 6e-1"=>...原创 2020-08-28 16:50:23 · 195 阅读 · 0 评论 -
Leet Code OJ 57. Insert Interval [Difficulty: Hard] -python
57.Insert Interval[Hard]Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example 1:Input: intervals = ...原创 2020-08-27 12:18:55 · 172 阅读 · 0 评论 -
Leet Code OJ 56. Merge Intervals [Difficulty: Medium] -Python
56.Merge Intervals【Medium】Given a collection of intervals, merge all overlapping intervals.Example 1:Input: intervals = [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps, merge them .原创 2020-08-27 12:08:40 · 193 阅读 · 0 评论 -
平安科技2020校招技术岗部分编程题汇总-分糖果
n个小朋友坐在一排,每个小朋友拥有ai个糖果,现在你要在他们之间转移糖果,使得最后所有小朋友拥有的糖果数都相同,每一次,你只能从一个小朋友身上拿走恰好两个糖果到另一个小朋友上,问最少需要移动多少次可以平分糖果,如果方案不存在输出-1。输入描述:每个输入包含一个测试用例。每个测试用例的第一行包含一个整数n(1 <= n <= 100),接下来的一行包含n个整数ai(1 <= ai <= 100)。输出描述:输出一行表示最少需要移动多少次可以平分苹...原创 2020-08-26 22:52:41 · 882 阅读 · 0 评论 -
平安科技2020校招技术岗部分编程题汇总-查找字符串最长公共子串
请编码实现一个命令行工具,找出指定的2个字符串的最长公共子串。输入描述:命令行工具接收两个字符串参数。输入字符串的合法字符集为[a-zA-Z0-9],大小写敏感,无需考虑异常输入场景。输出描述:所找到的公共子串;如果存在多个等长的公共子串,则请按字母序排序,依次打印出所有公共子串,每行一个。输入例子1:1234567 12893457输出例子1:345思路:1.建立一个全0矩阵,如果匹配就+1,取对角线上最大值就是最长公共子串了。...原创 2020-08-26 22:50:54 · 401 阅读 · 0 评论 -
Leet Code OJ 28. Implement strStr() [Difficulty: Easy] -python
28.Implement strStr()EasyImplementstrStr().Return the index of the first occurrence of needle in haystack, or-1if needle is not part of haystack.Example 1:Input: haystack = "hello", needle = "ll"Output: 2Example 2:Input: haystack = "a...原创 2020-08-26 22:36:34 · 169 阅读 · 0 评论 -
平安科技2020校招技术岗部分编程题汇总-字符串异构同质判定
题目:请编码实现一个命令行工具,判定两个指定的字符串是否异构同质;异构同质的定义为:一个字符串的字符重新排列后,能变成另一个字符串。输入描述:以空格字符分隔的两个字符串;输入字符串的合法字符集为[a-zA-Z0-9 ],大小写敏感,无需考虑异常输入场景。输出描述:如果判定两个字符串异构同质,则输出true,否则输出false。输入例子1:abc acb输出例子1:true解法,就是分别将两字符串排序再判断是否相等。或者直接计数每个字符的...原创 2020-08-26 12:51:19 · 507 阅读 · 0 评论 -
Leet Code OJ 21. Merge Two Sorted Lists [Difficulty: Easy] -python
21.Merge Two Sorted Lists[Easy]Merge two sorted linked lists and return it as a newsortedlist. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1->2-&...原创 2020-08-26 00:12:59 · 160 阅读 · 0 评论 -
Leet Code OJ 20. Valid Parentheses [Difficulty: Easy] -python
20.Valid Parentheses[Easy]Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets. Open brackets m...原创 2020-08-24 22:29:02 · 180 阅读 · 0 评论 -
Leet Code OJ 15. 3Sum [Difficulty: Medium]-python
题目:一开始是用暴力求解,结果TL,超时。代码如下:#15#先对数据排序,如果第一个数就大于0则不可能和为0class Solution: def threeSum(self, nums): x=[] y=[] y1=[] nums.sort() for i in range(0,len(nums)-2): if nums[0原创 2020-08-23 23:38:47 · 134 阅读 · 0 评论 -
Leet Code OJ 8. String to Integer (atoi) [Difficulty: Medium] -python
题目:https://leetcode.com/problems/string-to-integer-atoi/8.String to Integer (atoi)Medium16849704Add to ListShareImplementatoiwhichconverts a string to an integer.The function first discards as many whitespace characters as necessary until the...原创 2020-08-22 23:51:32 · 192 阅读 · 0 评论 -
Leet Code OJ 1. Two Sum [Difficulty: Easy]-Python
题目:1.Two SumGiven an array of integers, returnindicesof the two numbers such that they add up to a specific target.You may assume that each input would haveexactlyone solution, and you may not use thesameelement twice.Example:Given nums =...原创 2020-08-07 22:13:52 · 173 阅读 · 0 评论 -
Leet Code OJ 刷题顺序参考
出现频度为5:1.Leet Code OJ 1. Two Sum [Difficulty: Easy]2.Leet Code OJ 8. String to Integer (atoi) [Difficulty: Easy]3.Leet Code OJ 15. 3Sum [Difficulty: Medium]4.Leet Code OJ 20. Valid Parentheses [Difficulty: Easy]5.Leet Code OJ 21. Merge Two S...原创 2020-08-07 22:00:32 · 458 阅读 · 0 评论