leetcode算法从零到结束
一题一题扎实刷leetcode,尽量记录每一题的思路和解法,基本用python实现
奋力翻身的咸鱼=_=
目前学习兴趣为机器学习,深度学习和计算机视觉,曾经学习过的领域为网络工程。
展开
-
leetcode 解题目录索引 Python3 一步一步持续更新~
记录每一道题的解题url, 便于以后ctrl+find找到。都是详解思路以及相关证明,而不是单单只有一份代码,尽可能总结每道题多种解决思路。涉及到复杂的知识点会给一些参考链接。如果有新的解题思路可以在题目下留言评论,会更新。因为楼主目前学业压力比较大,尽量一天1~2道题,希望有生之年能全写完。。。当然是记录自己的解题。leetcode 1. two sumleetco...原创 2019-12-02 23:49:11 · 761 阅读 · 0 评论 -
leetcode 32. Longest Valid Parentheses Python3 解
一.问题描述Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.Example 1:Input: s = "(()"Output: 2Explanation: The longest valid parentheses substring is "()".Example...原创 2020-12-10 20:05:53 · 415 阅读 · 2 评论 -
leetcode 30. Substring with Concatenation of All Words Python3
一.问题描述You are given a stringsand an array of stringswordsofthe same length. Returnall starting indices of substring(s) insthat is a concatenation of each word inwordsexactly once,in any order,andwithout any intervening characters.You can r...原创 2020-10-17 17:02:08 · 452 阅读 · 0 评论 -
leetcode 25. Reverse Nodes in k-Group Python3 递归+迭代
一.问题描述Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.kis a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple ofkthen left-out nodes...原创 2020-10-16 21:03:21 · 419 阅读 · 0 评论 -
leetcode 23. Merge k Sorted Lists Python3 多解
一.问题描述You are given an array ofklinked-listslists, each linked-list is sorted in ascending order.Merge all the linked-lists into one sorted linked-list and return it.Example 1:Input: lists = [[1,4,5],[1,3,4],[2,6]]Output: [1,1,2,3,4,4,5,6]...原创 2020-10-16 00:43:46 · 350 阅读 · 0 评论 -
Leetcode 10. Regular Expression Matching Python3 递归与动态规划
一.问题描述Given an input string (s) and a pattern (p), implement regular expression matching with support for'.'and'*'where:'.'Matches any single character. '*'Matches zero or more of the preceding element.The matching should cover theentire...原创 2020-10-15 00:46:46 · 295 阅读 · 0 评论 -
leetcode 22. Generate Parentheses 递归+迭代 python3
一.问题描述Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:[ "((()))", "(()())", "(())()", ...原创 2020-03-27 21:39:39 · 305 阅读 · 0 评论 -
leetcode 46. Permutations 迭代+递归 python3
一.问题描述Given a collection ofdistinctintegers, return all possible permutations.Example:Input: [1,2,3]Output:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]二.解题思路主要是有...原创 2020-03-25 19:00:11 · 414 阅读 · 0 评论 -
leetcode 1299. Replace Elements with Greatest Element on Right Side 详解 python3
一.问题描述Given an arrayarr,replace every element in that array with the greatest element among the elements to itsright, and replace the last element with-1.After doing so, return the array....原创 2020-01-28 18:04:27 · 842 阅读 · 0 评论 -
leetcode 1331. Rank Transform of an Array 详解 python3
一.问题描述Given an array of integersarr, replace each element with its rank.The rank represents how large the element is. The rank has the following rules:Rank is an integer starting from 1. The l...原创 2020-01-27 18:01:53 · 766 阅读 · 0 评论 -
leetcode 1332. Remove Palindromic Subsequences 详解 python3
一.问题描述Given a stringsconsisting only ofletters'a'and'b'. In a single step you can remove onepalindromicsubsequencefroms.Return the minimum number of steps to make the given string empty....原创 2020-01-26 18:55:22 · 1152 阅读 · 0 评论 -
leetcode 1304. Find N Unique Integers Sum up to Zero 详解 python3
一.问题描述Given an integern, returnanyarray containingnuniqueintegers such that they add up to 0.Example 1:Input: n = 5Output: [-7,-1,1,3,4]Explanation: These arrays also are accepted [-...原创 2020-01-24 17:21:40 · 1048 阅读 · 0 评论 -
leetcode 1309. Decrypt String from Alphabet to Integer Mapping 详解 python3
一.问题描述Given a stringsformed by digits ('0'-'9')and'#'.We want to mapsto English lowercase characters as follows:Characters ('a'to'i')arerepresented by('1'to'9')respectively. Cha...原创 2020-01-23 21:57:36 · 524 阅读 · 0 评论 -
leetcode 1313. Decompress Run-Length Encoded List 详解 python3
一.问题描述We are given a listnumsof integers representing a list compressed with run-length encoding.Consider each adjacent pairof elements[a, b] = [nums[2*i], nums[2*i+1]](withi >= 0). For ...原创 2020-01-22 17:56:32 · 1238 阅读 · 0 评论 -
leetcode 1317. Convert Integer to the Sum of Two No-Zero Integers 详解 python3
一.问题描述Given an integern. No-Zero integer is a positive integer whichdoesn't contain any 0in its decimal representation.Returna list of two integers[A, B]where:AandBare No-Zero integers....原创 2020-01-21 20:15:46 · 657 阅读 · 2 评论 -
leetcode 1323. Maximum 69 Number 详解 python3
一.问题描述Given a positive integernumconsisting only of digits 6 and 9.Return the maximum number you can get by changingat mostone digit (6 becomes 9, and 9 becomes 6).Example 1:Input: num...原创 2020-01-20 16:26:03 · 785 阅读 · 0 评论 -
leetcode 7. Reverse Integer 详解 python3
一.问题描述Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Note:Assume we...原创 2020-01-19 17:22:48 · 528 阅读 · 0 评论 -
leetcode 204. Count Primes 埃拉托斯特尼筛法 python3
一.问题描述Count the number of prime numbers less than a non-negative number,n.Example:Input: 10Output: 4Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.二.解题思路最基本的方法:...原创 2020-01-18 19:30:00 · 834 阅读 · 0 评论 -
leetcode 189. Rotate Array O(1)内存 python3
一.问题描述Given an array, rotate the array to the right byksteps, wherekis non-negative.Example 1:Input: [1,2,3,4,5,6,7] and k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the rig...原创 2020-01-18 00:14:08 · 272 阅读 · 2 评论 -
leetcode 69. Sqrt(x) 二分法 python3
一.问题描述Implementint sqrt(int x).Compute and return the square root ofx, wherexis guaranteed to be a non-negative integer.Since the return typeis an integer, the decimal digits are truncated ...原创 2020-01-16 18:28:50 · 503 阅读 · 0 评论 -
leetcode 28. Implement strStr() 详解 python3
一.问题描述ImplementstrStr().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: 2...原创 2020-01-15 19:11:35 · 399 阅读 · 0 评论 -
leetcode 125. Valid Palindrome 正则 python3
学期考试结束,重新开始刷leetcode!一.问题描述Given 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 str...原创 2020-01-14 19:39:53 · 319 阅读 · 0 评论 -
leetcode 190. Reverse Bits 位操作 python3
一.问题描述Reverse bits of a given 32 bits unsigned integer.Example 1:Input: 00000010100101000001111010011100Output: 00111001011110000010100101000000Explanation: The input binary string 0000001...原创 2019-12-12 01:09:50 · 263 阅读 · 0 评论 -
leetcode 14. Longest Common Prefix 二分法 python3
一.问题描述Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string"".Example 1:Input: ["flower","flow","flight"]...原创 2019-12-11 06:23:55 · 285 阅读 · 0 评论 -
leetcode 160. Intersection of Two Linked Lists 常数内存 python3
一.问题描述Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:begin to intersect at node c1.Example 1:...原创 2019-12-10 01:20:30 · 267 阅读 · 0 评论 -
leetcode 234. Palindrome Linked List 常数内存 python3
一.问题描述Given a singly linked list, determine if it is a palindrome.Example 1:Input: 1->2Output: falseExample 2:Input: 1->2->2->1Output: trueFollow up:Could you do it in O(n...原创 2019-12-07 19:59:57 · 200 阅读 · 0 评论 -
leetcode 88. Merge Sorted Array 详解 python3
一.问题描述Given two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.Note:The number of elements initialized innums1andnums2aremandnrespectively. You may as...原创 2019-12-06 19:47:08 · 461 阅读 · 0 评论 -
leetcode 20. Valid Parentheses 栈 python3
一.问题描述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 t...原创 2019-12-05 17:50:49 · 231 阅读 · 0 评论 -
leetcode 172. Factorial Trailing Zeroes 非阶乘 python3
一.问题描述Given an integern, return the number of trailing zeroes inn!.Example 1:Input: 3Output: 0Explanation:3! = 6, no trailing zero.Example 2:Input: 5Output: 1Explanation:5! = 120, ...原创 2019-12-05 01:27:48 · 276 阅读 · 0 评论 -
leetcode 141. Linked List Cycle 常数内存 python3
一.问题描述Given a linked list, determine if it has a cycle in it.To represent a cycle in the given linked list, we use an integerposwhich represents the position (0-indexed)in the linked list where...原创 2019-12-04 01:20:15 · 218 阅读 · 0 评论 -
leetcode 155. Min Stack 双栈 python3
一.问题描述Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top...原创 2019-12-03 04:26:54 · 233 阅读 · 0 评论 -
leetcode 198. House Robber 动态规划 python3
一.问题描述You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjace...原创 2019-12-02 04:19:57 · 294 阅读 · 0 评论 -
leetcode 66. Plus One 详解 python3
一.问题描述Given anon-emptyarray of digitsrepresenting a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each...原创 2019-12-01 02:50:19 · 312 阅读 · 0 评论 -
leetcode 326. Power of Three 详解 python3
一.问题描述Given an integer, write a function to determine if it is a power of three.Example 1:Input: 27Output: trueExample 2:Input: 0Output: falseExample 3:Input: 9Output: trueExamp...原创 2019-11-30 04:50:36 · 303 阅读 · 0 评论 -
leetcode 26. Remove Duplicates from Sorted Array 详解 python3
一.问题描述Given a sorted arraynums, remove the duplicatesin-placesuch that each element appear onlyonceand return the new length.Do not allocate extra space for another array, you must do this by...原创 2019-11-28 18:15:49 · 419 阅读 · 0 评论 -
leetcode 101. Symmetric Tree 递归和迭代 python3
一.问题描述Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree[1,2,2,3,4,4,3]is symmetric: 1 / \ 2 2 / \ / \3 4...原创 2019-11-28 03:32:26 · 244 阅读 · 0 评论 -
leetcode 70. Climbing Stairs 动态规划 python3
一.问题描述You 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?Note:Givennwill be a ...原创 2019-11-26 17:10:03 · 269 阅读 · 0 评论 -
leetcode 191. Number of 1 Bits 详解 python3
一.问题描述Write a function that takes an unsigned integer and returnthe number of '1'bits it has (also known as theHamming weight).Example 1:Input: 00000000000000000000000000001011Output: 3...原创 2019-11-26 04:11:22 · 320 阅读 · 0 评论 -
leetcode 202. Happy Number 详解 python3
一.问题描述Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the s...原创 2019-11-25 07:07:47 · 357 阅读 · 0 评论 -
leetcode 121. Best Time to Buy and Sell Stock 动态规划 python3
一.问题描述Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the...原创 2019-11-23 18:26:35 · 310 阅读 · 0 评论