leetcode
勤奋的伙计
这个作者很懒,什么都没留下…
展开
-
First Missing Positive
First Missing Positive:Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run i转载 2015-06-20 09:06:33 · 319 阅读 · 0 评论 -
Convert Sorted List to Binary Search Tree
题目:Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.解:/** * Definition for singly-linke原创 2015-07-30 23:46:20 · 323 阅读 · 0 评论 -
Palindrome Partitioning
Palindrome PartitioningGiven a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s =原创 2015-08-01 10:01:30 · 320 阅读 · 0 评论 -
n皇后问题
N-Queens:来自leetcodeFollow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.计算机n皇后问题的不同放法:class Solution {public:原创 2015-08-13 21:15:42 · 510 阅读 · 0 评论 -
最长公共子序列问题
最长公共子序列问题是使用动态规划的典型应用:解决此问题需要定义二维辅助数组:dp[m+1][n+1]其基本公式:最后通过回溯,找到其公共子序列:回溯方法如下:此图摘自:http://blog.csdn.net/yysdsyl/article/details/4226630实例程序如下:#include#include#include#inc原创 2015-06-21 16:22:32 · 455 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
原题:Binary Tree Maximum Path Sum来自leetcode:https://leetcode.com/problems/binary-tree-maximum-path-sum/Given a binary tree, find the maximum path sum.The path may start and end at any node原创 2015-07-31 22:22:08 · 384 阅读 · 0 评论 -
Word Break
原题:Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict =原创 2015-08-03 12:07:36 · 327 阅读 · 0 评论 -
Sort List
Sort List Sort a linked list in O(n log n) time using constant space complexity.题目来自leetcode:https://leetcode.com/problems/sort-list/解:/** * Definition for singly-linked list. * struct原创 2015-08-03 19:36:00 · 365 阅读 · 0 评论 -
Maximum Gap
Maximum GapGiven an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains l转载 2015-08-04 11:03:23 · 437 阅读 · 0 评论 -
Dungeon Game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially p转载 2015-08-05 17:13:25 · 338 阅读 · 0 评论 -
最低公共祖先Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes原创 2015-08-19 11:07:54 · 319 阅读 · 0 评论 -
Majority Element I, II
Majority ElementGiven an array of size n, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋ times.You may assume that the array is non-empty and原创 2015-08-21 10:38:43 · 353 阅读 · 0 评论 -
Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and [2,1,1].原创 2015-07-17 19:05:03 · 481 阅读 · 0 评论 -
经典中的经典Unique Binary Search Trees II
Unique Binary Search Trees II原题:Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should原创 2015-07-29 20:37:45 · 529 阅读 · 0 评论 -
Reverse Nodes in k-Group
翻转节点Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain原创 2015-07-14 20:31:37 · 486 阅读 · 0 评论 -
3sum、3Sum closet、 4sum
1. 3Sum【题目】Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Element原创 2015-06-18 14:03:11 · 798 阅读 · 0 评论 -
leetcode: Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at原创 2015-06-26 19:34:47 · 358 阅读 · 0 评论 -
Best Time to Buy and Sell Stock
1. 题目:Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie原创 2015-06-29 22:33:24 · 532 阅读 · 0 评论 -
Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",原创 2015-07-02 20:55:29 · 598 阅读 · 0 评论 -
leetcode——Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2015-06-16 00:19:34 · 362 阅读 · 0 评论 -
leetcode——Largest Rectangle in Histogram
原题Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where原创 2015-06-14 16:49:52 · 627 阅读 · 0 评论 -
Edit Distance
原题: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 on原创 2015-07-06 22:46:40 · 407 阅读 · 0 评论 -
Restore IP Addresses
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"]. (Order原创 2015-07-07 17:40:18 · 634 阅读 · 0 评论 -
Trie树使用
leetcode题目:https://leetcode.com/problems/add-and-search-word-data-structure-design/Add and Search Word - Data structure designDesign a data structure that supports the following two operatio原创 2015-08-07 21:01:09 · 385 阅读 · 0 评论 -
Course Schedule
原题:来自leetcode的https://leetcode.com/problems/course-schedule/There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to tak原创 2015-08-07 19:55:31 · 429 阅读 · 0 评论 -
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 sudoku原创 2015-07-14 20:42:57 · 767 阅读 · 0 评论 -
Generate Parentheses
Generate Parentheses:Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())"原创 2015-07-02 21:00:57 · 363 阅读 · 0 评论