Leetcode
Leetcode解题我的方法
Leleprogrammer
python。。
展开
-
LeetCode 46.全排列 Python 3 回溯算法
这道题目,主要通过不断遍历并递归一步步接近答案。原创 2022-10-03 23:05:48 · 764 阅读 · 2 评论 -
Leetcode LCP 17.速算机器人 Python 3
Leetcode LCP 17参考代码如下:题目链接:力扣https://leetcode.cn/problems/nGK0Fy/原创 2022-07-12 13:50:00 · 266 阅读 · 0 评论 -
Leetcode 面试题 08.03.魔术索引 Python 3
Leetcode 面试题 08.03题参考代码:题目链接:力扣https://leetcode.cn/problems/magic-index-lcci/原创 2022-07-11 23:06:58 · 179 阅读 · 0 评论 -
Leetcode 面试题40.最小的k个数 Python 3
Leetcode 面试题40参考代码如下题目链接:力扣https://leetcode.cn/problems/zui-xiao-de-kge-shu-lcof原创 2022-07-11 23:02:41 · 170 阅读 · 0 评论 -
Leetcode 剑指 Offer 65.不用加减乘除做加法 Python 3
Leetcode 剑指 Offer 65题参考代码如下:题目链接:力扣https://leetcode.cn/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/原创 2022-07-11 22:48:11 · 120 阅读 · 0 评论 -
Leetcode 剑指 Offer 30.包含min函数的栈 Python 3
Leetcode 剑指 Offer 30题参考代码如下:题目链接:力扣https://leetcode.cn/problems/bao-han-minhan-shu-de-zhan-lcof原创 2022-07-11 22:41:47 · 147 阅读 · 0 评论 -
Leetcode 剑指 Offer 17.打印从1到最大的n位数 Python 3
Leetcode 剑指 Offer 17题参考代码如下:执行用时:32ms 击败97.10%内存:20.6MB 击败70.94%题目链接:力扣https://leetcode.cn/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/原创 2022-07-11 22:37:09 · 183 阅读 · 0 评论 -
Leetcode 剑指 Offer 11.旋转数组的最小数字 Python 3
Leetcode 剑指 Offer 11.旋转数组的最小数字参考代码如下:题目链接:https://leetcode.cn/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/原创 2022-07-11 22:28:40 · 129 阅读 · 0 评论 -
Leetcode 剑指 Offer 09.用两个栈实现队列 Python 3
Leetcode 剑指 Offer 09题的解法参考代码如下: 题目链接:https://leetcode.cn/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof原创 2022-07-11 22:16:55 · 167 阅读 · 0 评论 -
Leetcode 58.最后一个单词的长度 Python
class Solution: def lengthOfLastWord(self, s): return len(s.split()[-1])解题思路将字符串切片后再获取最后一个单词的长度就好啦!原创 2021-12-31 19:45:58 · 600 阅读 · 0 评论 -
Leetcode 1816.截断句子 Python
class Solution: def truncateSentence(self, s, k): sentence="" for c in s.split()[:k]: sentence=sentence+c+" " return sentence[:-1]解题思路:用split方法分词遍历列表的前k个单词添加到句中最后返回即可关注我,在Leetcode专栏中查看更多题目的解题思路吧!...原创 2021-12-06 13:45:22 · 651 阅读 · 0 评论 -
Leetcode 50.Pow(x,n) Python
class Solution: def myPow(self, x, n): return x**n这……这直接用x**n就好了啊。。。。。。原创 2021-12-06 12:53:32 · 536 阅读 · 0 评论 -
Leetcode 35.搜索插入位置 Python
class Solution: def searchInsert(self, nums, target): nums.append(target) nums=list(sorted(nums)) return nums.index(target)解题思路:将target插入到nums中把nums从小到大排列获取排列后target位于nums的位置最后返回即可关注我,在Leetcode专栏查看更多题目的解题思路吧!...原创 2021-12-05 18:45:56 · 191 阅读 · 0 评论 -
Leetcode 28.实现strStr() Python
class Solution: def strStr(self, haystack, needle): return haystack.find(needle)解题思路:使用字符串的find方法的效果刚好符合题意(过分简单。。。。)(成绩挺高的)关注我,在Leetcode专栏中查看更多题目的解题思路吧!...原创 2021-12-05 18:40:08 · 116 阅读 · 0 评论 -
Leetcode 27.移除元素 Python
class Solution: def removeElement(self, nums, val): while val in nums: nums.remove(val) return len(nums)过分简单,不做讲解(滑稽。。。。)(成绩蛮不错的)关注我,在Leetcode专栏中查看更多题目的解题思路吧!...原创 2021-12-05 18:36:58 · 105 阅读 · 0 评论 -
Leetcode 20.有效的括号 Python
class Solution: def isValid(self, s): p=[ (s.count("(")+s.count(")"))%2!=0, (s.count("[")+s.count("]"))%2!=0, (s.count("{")+s.count("}"))%2!=0, ] if p[0] or p[1] or p[2]: return F.原创 2021-12-05 18:07:44 · 152 阅读 · 0 评论 -
Leetcode 21.合并两个有序链表 Python
# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def mergeTwoLists(self, list1, list2): n1=[] n2=[] l1=list1.原创 2021-12-05 17:55:31 · 715 阅读 · 0 评论 -
Leetcode 14.最长公共前缀 Python
class Solution: def longestCommonPrefix(self, strs): longest="" for i in range(min([len(s) for s in strs])): yn=[] for s2 in strs: yn.append(s2.startswith(strs[0][:i+1])) if not (Fals.原创 2021-12-05 13:20:54 · 106 阅读 · 0 评论 -
Leetcode 13.罗马数字转整数 Python
class Solution: def romanToInt(self, s): replace=[["IV","IIII"],["IX","VIIII"], ["XL","XXXX"],["XC","LXXXX"],["CD","CCCC"],["CM","DCCCC"]] for rep in replace: s=s.replace(rep[0],rep[1]) m=s.count("M") .原创 2021-12-05 13:10:38 · 108 阅读 · 0 评论 -
Leetcode 12.整数转罗马数字 Python
class Solution: def intToRoman(self, num): m=num//1000 y=num%1000 d=y//500 y=y%500 c=y//100 y=y%100 l=y//50 y=y%50 x=y//10 y=y%10 v=y//5 i=y%5 resu.原创 2021-12-04 19:01:45 · 278 阅读 · 0 评论 -
Leetcode 9.回文数 Python
class Solution: def isPalindrome(self, x): x=str(x) rev="" for s in x: rev=s+rev return rev==x解题思路:先把x转化为字符串然后把x反转保存到rev返回x==rev打败用户也是挺多的:(p.s.过分简单)关注我,在Leetcode专栏中查看更多题目的解题思路吧!...原创 2021-12-04 18:31:29 · 127 阅读 · 0 评论 -
Leetcode 8.字符串转换整数(atoi) Python
class Solution: def myAtoi(self, s): s=s.strip() read="" for i in range(len(s)): if i==0 and (s.startswith("-") or s.startswith("+")): read=read+s[i] continue try: .原创 2021-12-04 18:10:39 · 805 阅读 · 0 评论 -
Leetcode 7.整数反转 Python
class Solution: def reverse(self, x): result="" for s in str(x): result=s+result if "-" in result: result=result[-1]+result[:-1] result=int(result) if result<=-2**31 or result>=2**3.原创 2021-12-04 17:53:46 · 87 阅读 · 0 评论 -
Leetcode 4.寻找两个正序数组的中位数 Python
class Solution: def findMedianSortedArrays(self, nums1, nums2): li=nums1+nums2 li=list(sorted(li)) mid=(len(li)-1)/2 if int(mid)!=mid: mid1,mid2=int(mid-0.5),int(mid+0.5) return (li[mid1]+li[mid2.原创 2021-12-04 17:32:55 · 348 阅读 · 0 评论 -
Leetcode 3.无重复字符的最长子串 Python
class Solution: def lengthOfLongestSubstring(self, s): biggest=0 for i,v in enumerate(s): while True: try: if s[i+1] in v: raise Exception v=v+.原创 2021-12-04 14:08:01 · 3524 阅读 · 0 评论 -
Leetcode 1.两数之和 Python
class Solution: def twoSum(self, nums, target): for i,n in enumerate(nums): if target-n in nums and nums.index(target-n)!=i: return [i,nums.index(target-n)]解题思路:遍历数组里的每一个数字用和-加数求出另一个加数再判断求出的数字是否位于数组中并且这个数字.原创 2021-12-04 10:50:49 · 151 阅读 · 0 评论