leetcode题解
文章平均质量分 71
娃哈哈纯净李
这个作者很懒,什么都没留下…
展开
-
全排列的编码与解码(康拓展开)
一、康托展开:全排列到一个自然数的双射 X=an*(n-1)!+an-1*(n-2)!+...+ai*(i-1)!+...+a2*1!+a1*0! ai为整数,并且0 适用范围:没有重复元素的全排列 二、全排列的编码: {1,2,3,4,...,n}的排列总共有n!种,将它们从小到大排序,怎样知道其中一种排原创 2015-05-04 16:01:43 · 664 阅读 · 0 评论 -
Maximum Product Subarray (leetcode)
题目:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the原创 2014-11-21 22:04:25 · 503 阅读 · 0 评论 -
Symmetric Tree(leetcode)
题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2014-11-05 17:10:35 · 438 阅读 · 0 评论 -
Validate Binary Search Tree (leetcode)
题目:Given 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 keys less than the node原创 2014-11-05 14:55:56 · 418 阅读 · 0 评论 -
Evaluate Reverse Polish Notation (leetcode)
题目:原创 2014-11-21 17:31:31 · 397 阅读 · 0 评论 -
Binary Tree Level Order Traversal(leetcode)
题目:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9原创 2014-11-05 17:29:18 · 323 阅读 · 0 评论 -
Same Tree(leetcode)
题目:原创 2014-11-05 16:34:55 · 410 阅读 · 0 评论 -
Recover Binary Search Tree (leetcode)
题目:原创 2014-11-05 15:57:03 · 426 阅读 · 0 评论 -
Find Minimum in Rotated Sorted Array(leetcode)
题目:原创 2014-11-22 11:06:59 · 430 阅读 · 0 评论 -
Spiral Matrix (leetcode)
题目:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9原创 2014-11-26 15:43:06 · 572 阅读 · 0 评论 -
Spiral Matrix II(leetcode)
题目:Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9原创 2014-11-26 16:03:34 · 425 阅读 · 0 评论 -
Sort List(leetcode)
题目:题目来源:https://oj.leetcode.com/problems/sort-list/解题思路:如果有O(n)的额外空间的话就先拷贝出来,用vector排序后再拷回去,如果必须原址排序就需要用mergeSort进行排序了。O(n)的额外空间时:原创 2014-11-20 19:42:26 · 464 阅读 · 0 评论 -
Insertion Sort List(leetcode)
题目:原创 2014-11-20 16:46:05 · 439 阅读 · 0 评论 -
LRU Cache (leetcode)
题目:Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of th原创 2014-11-20 16:14:30 · 527 阅读 · 0 评论 -
Interleaving String (leetcode)
题目:Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbba原创 2014-11-04 17:36:29 · 482 阅读 · 0 评论 -
Substring with Concatenation of All Words(leetcode)
题目:You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and原创 2014-11-25 20:20:41 · 536 阅读 · 0 评论 -
Min Stack(leetcode)
题目: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(原创 2014-11-21 22:36:20 · 563 阅读 · 0 评论 -
Find Minimum in Rotated Sorted Array II (leetcode)
题目:Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at som原创 2014-11-22 11:39:52 · 398 阅读 · 0 评论 -
Binary Tree Zigzag Level Order Traversal(leetcode)
题目:Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Give原创 2014-11-06 15:05:52 · 413 阅读 · 0 评论 -
计算字符串的相似度
《编程之美》3.3节:计算字符串的相似度问题:对于给定的两个字符串,用最少的操作:插入、删除和替换,使得两个字符串相同。找出这个最少需要操作的步数。解法:1)一步操作后,再将A[2:end]和B[2:end]编程相同的字符串 2)一步操作后,再将A[1:end]和B[2:end]编程相同的字符串 3)一步操作后,再将A[2:end]和B[1:end]编程相同的字符串原创 2015-01-08 21:42:43 · 569 阅读 · 0 评论 -
Minimum Window Substring(leetcode)
题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum windo原创 2014-12-01 17:52:50 · 482 阅读 · 0 评论 -
Edit Distance (leetcode)
题目:Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted o原创 2014-12-01 17:09:29 · 553 阅读 · 0 评论 -
Restore IP Addresses(leetcode)
题目: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"]原创 2014-12-01 16:31:56 · 492 阅读 · 0 评论 -
Set Matrix Zeroes (leetcode)
题目:Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up:Did you use extra space?A straight forward solution原创 2014-11-29 15:48:33 · 420 阅读 · 0 评论 -
Pascal's Triangle (leetcode)
题目:Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]题目来源:https://oj.lee原创 2014-11-08 17:47:51 · 391 阅读 · 0 评论 -
Path Sum II(leetcode)
题目:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5原创 2014-11-07 17:29:34 · 430 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Postorder Traversal (leetcode)
题目:Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原创 2014-11-07 10:53:12 · 527 阅读 · 0 评论 -
Simplify Path(leetcode)
题目:Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:原创 2014-11-29 15:24:20 · 559 阅读 · 0 评论 -
Valid Number(leetcode)
题目: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 problem statement to b原创 2014-11-29 11:45:09 · 560 阅读 · 0 评论 -
Regular Expression Matching(leetcode)
题目:原创 2014-11-24 19:09:54 · 452 阅读 · 0 评论 -
Search in Rotated Sorted Array II(leetcode)
题目: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"]原创 2014-11-29 16:49:58 · 419 阅读 · 0 评论 -
Max Points on a Line(leetcode)
题目:原创 2014-11-24 14:44:25 · 436 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal(leetcode)
题目:Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原创 2014-11-06 16:18:36 · 421 阅读 · 0 评论 -
Maximum Depth of Binary Tree(leetcode)
题目:原创 2014-11-06 15:15:57 · 470 阅读 · 0 评论 -
Binary Tree Inorder Traversal (leetcode)
二叉树的中序遍历,其中inorder函数是原创 2014-11-03 15:35:34 · 464 阅读 · 0 评论 -
Binary Tree Postorder Traversal (leetcode)
题目:Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recurs原创 2014-11-19 15:35:58 · 435 阅读 · 0 评论 -
Unique Binary Search Trees II(leetcode)
题目:Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1原创 2014-11-03 20:01:32 · 460 阅读 · 0 评论 -
Valid Palindrome(leetcode)
题目:Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car"原创 2014-11-11 15:22:36 · 372 阅读 · 0 评论 -
Binary Tree Maximum Path Sum(leetcode)
题目:原创 2014-11-11 14:52:53 · 390 阅读 · 0 评论 -
Best Time to Buy and Sell Stock III(leetcode)
题目:Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:原创 2014-11-10 20:17:12 · 426 阅读 · 0 评论