LeetCode
文章平均质量分 90
MSP_甄心cherish
这个作者很懒,什么都没留下…
展开
-
LeetCode-20.Valid Parentheses
Problem:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}"原创 2016-04-04 14:28:51 · 276 阅读 · 0 评论 -
LeetCode-24.Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y原创 2016-04-04 17:07:28 · 429 阅读 · 0 评论 -
LeetCode-38.Count and Say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2016-04-05 12:38:23 · 331 阅读 · 0 评论 -
LeetCode-16.3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2016-04-05 19:52:34 · 373 阅读 · 0 评论 -
LeetCode-100.Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value./** * De原创 2016-04-06 16:16:33 · 361 阅读 · 0 评论 -
LeetCode-129.Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2016-04-09 18:51:50 · 410 阅读 · 0 评论 -
LeetCode-279.Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =原创 2016-04-10 23:49:27 · 473 阅读 · 0 评论 -
LeetCode-235.Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined betw原创 2016-04-11 10:17:29 · 360 阅读 · 0 评论 -
LeetCode-236.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 node原创 2016-04-11 13:31:54 · 386 阅读 · 0 评论 -
LeetCode-283.Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you原创 2016-04-14 22:04:01 · 395 阅读 · 0 评论 -
LeetCode-203.Remove Linked List Elements
https://leetcode.com/problems/remove-linked-list-elements/Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val =原创 2016-05-24 10:22:12 · 333 阅读 · 0 评论 -
LeetCode-304.Range Sum Query 2D - Immutable
Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).The above rectangle (with the red bo原创 2016-05-24 13:11:17 · 390 阅读 · 0 评论 -
LeetCode-303.Range Sum Query - Immutable
https://leetcode.com/problems/range-sum-query-immutable/Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0,原创 2016-05-24 13:25:56 · 330 阅读 · 0 评论 -
LeetCode-66.Plus One
https://leetcode.com/problems/plus-one/Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is原创 2016-05-24 16:43:45 · 271 阅读 · 0 评论 -
LeetCode-67.Add Binary
https://leetcode.com/problems/add-binary/Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".如果a b位数不等,则进行补“0”操作public s原创 2016-05-24 20:32:20 · 288 阅读 · 0 评论 -
LeetCode-26&80.Remove Duplicates from Sorted Array
https://leetcode.com/problems/remove-duplicates-from-sorted-array/Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do no原创 2016-05-19 12:32:33 · 271 阅读 · 0 评论 -
LeetCode-39&40&216.Combination Sum
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numb原创 2016-04-16 22:24:23 · 541 阅读 · 0 评论 -
LeetCode-62&63.Unique Paths
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 trying to reach the原创 2016-04-11 22:45:44 · 520 阅读 · 0 评论 -
LeetCode-136&137&260.Single Number
https://leetcode.com/problems/single-number/Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime co原创 2016-05-24 22:06:23 · 269 阅读 · 0 评论 -
LeetCode-54&59.Spiral Matrix
https://leetcode.com/problems/spiral-matrix/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:原创 2016-05-25 23:51:01 · 397 阅读 · 0 评论 -
LeetCode-48.Rotate Image
https://leetcode.com/problems/rotate-image/You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?原创 2016-05-26 16:54:06 · 332 阅读 · 0 评论 -
LeetCode-64.Minimum Path Sum
https://leetcode.com/problems/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 pat原创 2016-05-26 17:15:33 · 268 阅读 · 0 评论 -
LeetCode-143.Reorder List
https://leetcode.com/problems/reorder-list/Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.原创 2016-05-26 18:43:37 · 302 阅读 · 0 评论 -
LeetCode-147.Insertion Sort List
https://leetcode.com/problems/insertion-sort-list/Sort a linked list using insertion sortpublic ListNode InsertionSortList(ListNode head) { if (head == null || head.next == n原创 2016-05-26 20:39:23 · 327 阅读 · 0 评论 -
LeetCode-120.Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [原创 2016-04-19 09:52:58 · 344 阅读 · 0 评论 -
LeetCode-226.Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howe原创 2016-04-19 14:49:09 · 383 阅读 · 0 评论 -
LeetCode-148.Sort List
https://leetcode.com/problems/sort-list/Sort a linked list in O(n log n) time using constant space complexity.采用归并排序注意快慢指针的使用,需“提前”终止判断/** * Definition for singly-linked list. * public c原创 2016-05-26 21:45:42 · 249 阅读 · 0 评论 -
LeetCode-144.Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2016-04-19 15:49:11 · 322 阅读 · 0 评论 -
LeetCode-94.Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio原创 2016-04-19 16:46:55 · 372 阅读 · 0 评论 -
LeetCode-58.Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-05-03 22:16:53 · 324 阅读 · 0 评论 -
LeetCode-32.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 "()",原创 2016-05-14 21:37:31 · 357 阅读 · 0 评论 -
LeetCode-84.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 width o原创 2016-05-14 22:43:20 · 515 阅读 · 0 评论 -
LeetCode-85.Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.此题初看是221题(http://blog.csdn.net/zmq570235977/article/details/51348028)的变式,实际上差别很大,原创 2016-05-15 12:33:47 · 368 阅读 · 0 评论 -
LeetCode-14.Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.暴力破解,逐个比较字符 public string LongestCommonPrefix(string[] strs) { if (strs.Length == 0)原创 2016-05-15 13:59:04 · 249 阅读 · 0 评论 -
LeetCode-34.Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found原创 2016-05-27 22:31:29 · 524 阅读 · 0 评论 -
LeetCode-98.Validate Binary Search Tree
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's key.Th原创 2016-04-20 14:58:24 · 427 阅读 · 0 评论 -
LeetCode-145.Binary Tree Postorder Traversal
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: Recursive solut原创 2016-04-20 16:20:08 · 402 阅读 · 0 评论 -
LeetCode-5.Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.使用双指针public clas原创 2016-05-15 15:52:14 · 316 阅读 · 0 评论 -
LeetCode-1.Two Sum
https://leetcode.com/problems/two-sum/Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exact原创 2016-05-15 21:54:57 · 221 阅读 · 0 评论 -
LeetCode-2.Add Two Numbers
https://leetcode.com/problems/add-two-numbers/You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a singl原创 2016-05-15 22:00:10 · 336 阅读 · 0 评论