leetcode python题解

【实例简介】
leetcode python题解，包含大量leetcode题目的解法，源代码，python实现
Course Schedule 2 1.4.4 Number of islands 14.5 Heaps Merge K Sorted Linked Lists 1.5.1 Kth Largest Element in an Array 1.5.2 Arrays 1.6 2sum‖l 1.6 2SumⅢ 1.6.2 Contains Duplicate 1.6.3 Rotate Array 1.64 3 Sum Smaller 1.65 3 Sum closest 1.66 3 Sum 1.6.7 Two Sum 1.68 Plus One 1.6.9 Best Time to Buy and Sell Stock 1.6.10 Shortest word distance 1.6.11 Move zeroes 1.6.12 Contains Duplicate 1.6.13 Majority Element 1.6.14 Remove Duplicates from Sorted Array 1.6.15 Nested List Weight Sum 1.6.16 Nested List Weighted Sum Il 1.6.17 Remove element 1.6.18 Intersection of Two Arrays ll 1.6.19 Merge Sorted Arrays 1.6.20 Reverse Vowels of a String 1.6.21 Intersection of Two Arrays 1.6.22 Container with most water 1.6.23 Product of Array Except Self 1.6.24 Trapping Rain Water 1.6.25 Maximum Subarray 1.6.26 Best Time to Buy and Sell Stock Il 1.6.27 Find Minimum in Rotated Sorted Array 1.6.28 Pascal's Triangle 1.6.29 Pascal's Triangle‖l 1.6.30 Summary Ranges 1.6.31 Missing Number 1.6.32 Strings Valid Anagram 1.7.1 Valid palindrome 1.7.2 Word Pattern 1.7.3 Valid Parentheses 1.7.4 Isomorphic Strings 1.7.5 Reverse String 1.7.6 Bit Manipulation Sum of Two Integers 18.1 Single Number 18.2 Single number‖ 18.3 Single Number Ill 1.8.4 Maths 1.9 Reverse Integer 1.9.1 Palindrome number 19.2 Pow(x, n) 19.3 Subsets 1.94 Subsets‖ 195 Fraction to Recurring Decimal 19.6 Excel sheet column number 19.7 Excel sheet column title 19.8 Factorial Trailing zeros 199 Happy Number 1.9.10 Count primes 1.9.11 Plus one 19.12 Divide Two Integers 19.13 Multiply Strings 1.9.14 Max Points on a line 1.9.15 Product of Array Except Self 19.16 Power of three 19.17 Integer Break 1.9.18 Power of four 9.19 Add digits 1.9.20 Ugly Number 1.9.21 gly Number ll 1.9.22 Super Ugly Number 19.23 Find K pairs with smallest sums 1.924 Self Crossing 1.9.25 Paint fence 1.9.26 Bulb switcher 19.27 Nim game 1.9.28 Matrix 1.10 Rotate Image 1.10.1 Set matrix Zeroes 1.10.2 Search a 2D Matrix 1.10.3 Search a 2d Matrix l 1.10.4 Spiral Matrix 1.10.5 Spiral Matrix‖l 1.10.6 Design LRU Cache 1.11.1 Introduction My Leetcode Solutions in Python This book will contain my solutions in Python to the leetcode problems. Currently, will just try to post the accepted solutions. The plan is to eventually include detailed explanations of each and every solution am doing this just for fun Linked List Cycle Linked List Cvcle Given a linked list, determine if it has a cycle in it Follow up: Can you solve it without using extra space? Url:https://leetcode.com/problems/linked-list-cycle/ Definition for singly-linked list class ListNode object) ### def init(self, x) self, val = x self, next None class Solution(object): def hasCycle(self, head) I I type head: ListNode rtype: bool II II if head = none return false else fast head slow= head While fast none and fast. next none sloW =slow next fast fast. next next if fast = slow: break i千fast None or fast. next = none return False elif fast = slow return true return false Linked List Cycle Reverse Linked List Reverse Linked list Reverse a singly linked list Url:https://eetcode.com/problems/reverse-linked-list/ definition for singly-linked list #t class ListNode(object): ## def -init(self, x) self.∨al=x self next none class Solution(object): def reverseList(self, head) 11 II l1 type head: ListNode rtype: ListNode if head = none return none elif head != none and head next = none return head else temp None next node none While head None next node head next head. next temp temp= head head next node return temp Delete node in a linked list Delete node in a linked list Write a function to delete a node(except the tail) in a singly linked list, given only access to that node Supposed the linked list is 1->2->3->4 and you are given the third node with value 3, the linked list should become 1->2->4 after calling your function Url:https://eetcode.com/problems/delete-node-in-a-linked-list/ Definition for singly-linked list class ListNode(object): # def -init (self, x) # self, val x self, next None class solution(object): def deleteNode(self, node): I Il II type node: ListNode rtype: void Do not return anything modify node in-plac e instead I 1 11 f node = none pass e⊥se: next node node. next node val next node val node. next next node, next 【实例截图】
【核心代码】