leetcode
watchli
这个作者很懒,什么都没留下…
展开
-
Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].Given a collection of intervals, merge all overlapping inte原创 2017-03-08 19:00:46 · 157 阅读 · 0 评论 -
Permutation Sequence
Permutation Sequence The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3): “123”原创 2017-03-13 15:17:33 · 150 阅读 · 0 评论 -
Restore IP Addresses
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.原创 2017-03-29 21:28:39 · 217 阅读 · 0 评论 -
Simplify Path
Simplify Path Given an absolute path for a file (Unix-style), simplify it. For example, path = “/home/”, => “/home” path = “/a/./b/../../c/”, => “/c”class Solution { public: string simplifyPath原创 2017-03-14 16:50:44 · 258 阅读 · 0 评论 -
Climbing Stairs
Climbing Stairs You are climbing a stair case. It takes n steps 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? 问题描述:一个有n层阶梯的楼梯,原创 2017-03-14 17:03:15 · 140 阅读 · 0 评论 -
Largest Rectangle in Histogram & Maximal Rectangle
1.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 i原创 2017-03-23 22:51:55 · 174 阅读 · 0 评论 -
Search a 2D Matrix I,II
1. Search a 2D Matrix I Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right. The fi原创 2017-03-15 16:16:19 · 283 阅读 · 0 评论 -
Edit Distance
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 permitte原创 2017-03-15 16:34:34 · 146 阅读 · 0 评论 -
Minimum Window Substring
Minimum Window Substring 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” Minim原创 2017-03-17 12:57:03 · 221 阅读 · 0 评论 -
Sort Colors
* Sort Colors* Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use th原创 2017-03-17 13:02:27 · 143 阅读 · 0 评论 -
Unique Paths I,II
1.Unique Paths I A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is tryin原创 2017-03-13 14:53:50 · 139 阅读 · 0 评论 -
Reverse Linked List II
Reverse Linked List II 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原创 2017-03-29 00:38:33 · 199 阅读 · 0 评论 -
Decode Ways
Decode Ways A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine the total number of ways to decode i原创 2017-03-28 23:18:23 · 158 阅读 · 0 评论 -
Jump Game I,II
JUMP GAME I Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determi原创 2017-03-08 16:09:44 · 182 阅读 · 0 评论 -
Maximum Subarray
Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray原创 2017-03-08 15:40:54 · 170 阅读 · 0 评论 -
n-queens puzzle
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.N皇后问题是指在一个N*N的矩阵中,任意两个棋子不能出现在同行,同列,同斜线中,可以采用递归回溯的思想来编写程序。class Solution { public:原创 2017-03-07 14:55:25 · 333 阅读 · 2 评论 -
Word Search
Word Search Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or ve原创 2017-03-19 17:47:14 · 162 阅读 · 0 评论 -
Subsets
Subsets Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example, If nums = [1,2,3], a solution is:使用递归的思想来寻找子串,注意空字符串原创 2017-03-19 17:50:50 · 155 阅读 · 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.这道题是求解数独。 解题思想: 1.在每个原创 2017-03-09 21:24:28 · 186 阅读 · 0 评论 -
Remove Duplicates from Sorted List I II
Remove Duplicates from Sorted List I Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return原创 2017-03-20 17:08:13 · 209 阅读 · 0 评论 -
Partition List
Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nod原创 2017-03-27 19:56:56 · 163 阅读 · 0 评论 -
Scramble String
Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = “great”: To scrambl原创 2017-03-27 20:24:20 · 222 阅读 · 0 评论 -
Combinations
Combinations Given two integers n and k, return all possible combinations of k numbers out of 1 … n. For example, If n = 4 and k = 2, a solution is: 在leetcode做了很多类似的题目,用递归的思想去解决就可以了。class Solution原创 2017-03-17 13:18:39 · 259 阅读 · 0 评论