LeetCode(Python)
文章平均质量分 74
toplatona
坚持做一件平凡的事情就是不平凡
展开
-
LeetCode 74 Search a 2D Matrix(Python详解及实现)
【题目】Write an efficient algorithm that searchesfor a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from leftto right.The first integer of e原创 2017-08-08 09:24:10 · 369 阅读 · 0 评论 -
LeetCode 92 Reverse Linked List II (Python详解及实现)
【题目】Reverse a linked list from position m to n.Do it in-place and in one-pass. For example:Given 1->2->3->4->5->NULL, m= 2 and n = 4, return 1->4->3->2->5->NULL. Note:Given m, n sati原创 2017-08-10 11:09:23 · 1677 阅读 · 0 评论 -
LeetCode 93 Restore IP Addresses(Python详解及实现)
【题目】Given a string containing only digits,restore it by returning all possible valid IP address combinations. For example:Given "25525511135", return ["255.255.11.135","255.255.111.35"]. (原创 2017-08-10 13:57:28 · 1862 阅读 · 1 评论 -
LeetCode 94 Binary Tree Inorder Traversal(Python详解及实现)
【题目】Given a binary tree, return the inordertraversal of its nodes' values. For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recursive soluti原创 2017-08-10 16:10:57 · 4144 阅读 · 1 评论 -
LeetCode 65 ValidNumer(Python详解及实现)
【题目】Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problemstatement to be ambig原创 2017-08-03 18:09:21 · 623 阅读 · 0 评论 -
LeetCode 95 Unique Binary Search Tree II(Python详解及实现)
【题目】Given an integer n, generate allstructurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all5 unique BST's shown below.原创 2017-08-10 18:25:48 · 1612 阅读 · 0 评论 -
LeetCode 96 Unique Binary Search Tree(Python详解及实现)
【题目】Given an integer n, generate allstructurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return all5 unique BST's shown below.原创 2017-08-10 18:37:29 · 1020 阅读 · 0 评论 -
LeetCode 66 Plus One (Python详解及实现)
【题目】Given a non-negative integer represented asa non-empty array of digits, plus one to the integer. You may assume the integer do not containany leading zero, except the number 0 itself. Th原创 2017-08-03 19:23:19 · 666 阅读 · 0 评论 -
深度优先搜索和回溯(实例LeetCode 39 Combination Sum)
搜索是广泛使用的算法策略,就是用问题的所有可能按照一定的顺序、规则去试探。它利用计算机的高性能来有目的的穷举一个问题的部分或所有可能情况,从而求出问题的解。而深度优先搜索是搜索算法中最简单最常见的。 深度优先搜索(DepthFirst Search,缩写DFS),属于图算法的一种。DFS基本思想是对每一个可能的分支路径深入到不能再深入为止,且每个节点只能访问一次。如下图所示,为原创 2017-07-26 17:14:05 · 5769 阅读 · 0 评论 -
LeetCode 97 Interleaving String(Python详解及实现)
【题目】Given s1, s2, s3, find whether s3 is formedby the interleaving of s1 and s2. For example,Given:s1 = "aabcc",s2 = "dbbca", When s3 = "aadbbcbcac", returntrue.When s3 = "aadbbbaccc原创 2017-08-11 10:16:37 · 1773 阅读 · 0 评论 -
LeetCode 98 Validate Binary Search Tree(Python详解及实现)
【题目】Given a binary tree, determine if it is avalid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains onlynodes with keys less than the node's原创 2017-08-11 12:25:20 · 1139 阅读 · 0 评论 -
LeetCode 99 Recover Binary Search Tree(Python详解及实现)
【题目】Two elements of a binary search tree (BST)are swapped by mistake. Recover the tree without changing itsstructure. Note:A solution using O(n) space is prettystraight forward. Could you原创 2017-08-11 16:43:58 · 527 阅读 · 0 评论 -
LeetCode 100 Same Tree(Python详解及实现)
【题目】Given two binary trees, write a function tocheck if they are equal or not. Two binary trees are considered equal ifthey are structurally identical and the nodes have the same value. 给定两棵原创 2017-08-11 16:52:26 · 712 阅读 · 0 评论 -
LeetCode 55 Jump Game(Python 实现及详解)
Given an array of non-negative integers,you are initially positioned at the first index of the array. Each element in the array represents yourmaximum jump length at that position. Determine i原创 2017-07-27 17:13:39 · 1536 阅读 · 0 评论 -
LeetCode 68 Text Justification(Python详解及实现)
【题目】Given an array of words and a length L,format the text such that each line has exactly L characters and is fully (leftand right) justified. You should pack your words in a greedyapproach; th原创 2017-08-05 12:29:47 · 1134 阅读 · 0 评论 -
LeetCode 70 Climbing Stairs(Python详解及实现)
【题目】You are climbing a stair case. It takes nsteps to reach to the top. Each time you can either climb 1 or 2steps. In how many distinct ways can you climb to the top? Note: Given n will be原创 2017-08-05 12:56:00 · 1825 阅读 · 0 评论 -
LeetCode 71 Simplify Path(Python详解及实现)
【题目】Given an absolute path for a file(Unix-style), simplify it. For example,path = "/home/", =>"/home"path = "/a/./b/../../c/", =>"/c" 简化Unix上的绝对路径,也就是多个'/'代表一个,'..'表示返回上一级目录,‘.'代表当前目录。原创 2017-08-05 14:44:50 · 854 阅读 · 0 评论 -
LeetCode 72 Edit Distance(Python详解及实现)
【题目】Given two words word1 and word2, find theminimum number of steps required to convert word1 to word2. (each operation iscounted as 1 step.) You have the following 3 operationspermitted on a w原创 2017-08-05 16:17:05 · 4090 阅读 · 1 评论 -
LeetCode 91 Decode Ways (Python详解及实现)
【题目】Amessage containing letters from A-Z is being encoded to numbers using thefollowing mapping: 'A'-> 1'B'-> 2...'Z'-> 26Given anencoded message containing digits, determine the total n原创 2017-08-10 10:18:48 · 2423 阅读 · 0 评论 -
LeetCode 90 SubsetsII (Python详解及实现)
【题目】Given a collection of integers that mightcontain duplicates, nums, return all possible subsets. Note: The solution set must not containduplicate subsets. For example,If nums = [1,2,2],原创 2017-08-09 19:34:19 · 962 阅读 · 0 评论 -
LeetCode 89 Gray Code (Python详解及实现)
【题目】The gray code is a binary numeral systemwhere two successive values differ in only one bit. Given a non-negative integer n representingthe total number of bits in the code, print the sequenc原创 2017-08-09 19:23:05 · 1039 阅读 · 0 评论 -
LeetCode 56 Merge Intervals(Python实现及详解)
【题目】 Given a collection of intervals, merge all overlappingintervals. For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].输入一个区间的list,返回一个list(合并了所有有重叠的区间之后的list)。原创 2017-08-01 11:27:49 · 2265 阅读 · 0 评论 -
LeetCode 75 SortColor(Python详解及实现)
【题目】Given an array with n objects colored red,white or blue, sort them so that objects of the same color are adjacent, withthe colors in the order red, white and blue. Here, we will use the inte原创 2017-08-08 09:57:53 · 633 阅读 · 0 评论 -
LeetCode 76 Minimum Window Substring(Python详解及实现)
【题目】Given a string S and a string T, find theminimum window in S which will contain all the characters in T in complexityO(n). For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BA原创 2017-08-08 11:27:56 · 1860 阅读 · 0 评论 -
LeetCode 60 Permutation Sequence (Python实现及详解)
【题目】 The set [1,2,3,…,n] contains a total of n! uniquepermutations. By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3): "123""132"原创 2017-08-01 16:23:00 · 1697 阅读 · 0 评论 -
LeetCode 61. Rotate List(Python详解及实现)
【题目】Given a list, rotate the list to the rightby k places, where k is non-negative. For example:Given 1->2->3->4->5->NULLand k = 2,return 4->5->1->2->3->NULL.给定一个链表,将链表末尾的k个结点移动到最前面。【思路】原创 2017-08-01 17:51:56 · 849 阅读 · 0 评论 -
LeetCode 77 Combinations (Python详解及实现)
【题目】Given two integers n and k, return allpossible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],原创 2017-08-08 13:50:46 · 3037 阅读 · 0 评论 -
LeetCode 78 Subsets (Python详解及实现)
【题目】Given a set of distinct integers, nums,return all possible subsets. Note: The solution set must not containduplicate subsets. For example,If nums = [1,2,3], a solution is: [ [3],原创 2017-08-08 14:22:29 · 2404 阅读 · 0 评论 -
LeetCode 79 Word Search (Python详解及实现)
【题目】Given a 2D board and a word, find if theword exists in the grid. The word can be constructed from letters ofsequentially adjacent cell, where "adjacent" cells are thosehorizontally or vertic原创 2017-08-08 15:30:56 · 2680 阅读 · 0 评论 -
LeetCode 80 Remove Duplicates from Sorted Array II (Python详解及实现)
【题目】Follow up for "RemoveDuplicates":What if duplicates are allowed at mosttwice? For example,Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5,with the fir原创 2017-08-08 16:24:42 · 709 阅读 · 0 评论 -
LeetCode 81 Search in Rotated Sorted Array II (Python详解及实现)
【题目】Follow up for "Search in RotatedSorted Array":What if duplicates are allowed? Would this affect the run-time complexity?How and why?Suppose an array sorted in ascending orderis rotated a原创 2017-08-08 17:39:40 · 293 阅读 · 0 评论 -
25_LeetCode 82&83. Remove Duplicates from Sorted List(II) (Python详解及实现)
【题目】83Given a sorted linked list, delete allduplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return1->2->3. 给定一个有序链表,删除重复元素原创 2017-08-09 11:18:53 · 310 阅读 · 0 评论 -
LeetCode 84 Largest Rectangle in Histogram (Python详解及实现)
【题目】Given n non-negative integers representingthe histogram's bar height where the width of each bar is 1, find the area oflargest rectangle in the histogram.Above is a histogram where width of原创 2017-08-09 15:34:40 · 2189 阅读 · 0 评论 -
LeetCode ——37. Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution..A sudok原创 2017-07-25 14:15:12 · 234 阅读 · 0 评论 -
LeetCode 85 Maximal Rectangle (Python详解及实现)
【题目】Given a 2D binary matrix filled with 0'sand 1's, find the largest rectangle containing only 1's and return its area. For example, given the following matrix: 1 0 1 0 01 0 1 1 11 1 1原创 2017-08-09 16:37:19 · 1868 阅读 · 0 评论 -
LeetCode 86 Partition List (Python详解及实现)
【题目】Given a linked list and a value x,partition it such that all nodes less than x come before nodes greater than orequal to x. You should preserve the original relativeorder of the nodes in eac原创 2017-08-09 17:15:43 · 666 阅读 · 0 评论 -
LeetCode 64 Minimum Path Sum(Python详解及代码实现)
【题目】Given a m x n grid filled with non-negativenumbers, find a path from top left to bottom right which minimizes the sum ofall numbers along its path. Note: You can only move either down orrigh原创 2017-08-02 16:34:26 · 941 阅读 · 0 评论 -
LeetCode 87 Scramble String (Python详解及实现)
【题目】Given a string s1, we may represent it as abinary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1= "great": great / \原创 2017-08-09 18:30:23 · 545 阅读 · 0 评论 -
LeetCode 73 Set Matrix Zeroes(Python详解及实现)
【题目】Given a m x n matrix, if an element is 0,set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn)space is probably a bad原创 2017-08-05 18:09:35 · 1413 阅读 · 0 评论