Leetcode
Cabinathor
这个作者很懒,什么都没留下…
展开
-
[leetcode]Remove Nth Node From End of List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* re原创 2015-05-27 21:25:14 · 398 阅读 · 0 评论 -
[leetcode]Symmetric Tree
题目来源:https://leetcode.com/problems/symmetric-tree/Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:原创 2015-05-27 21:35:23 · 345 阅读 · 0 评论 -
Convert Sorted List to Binary Search Tree
From :https://leetcode.com/problems/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./** * Defi原创 2015-06-16 15:43:48 · 309 阅读 · 0 评论 -
[leetcode]Remove Linked List Elements
From: https://leetcode.com/problems/remove-linked-list-elements/-------------------------------------Question:Remove all elements from a linked list of integers that have value val.Examp原创 2015-05-28 10:49:56 · 258 阅读 · 0 评论 -
[leetcode] House Robber
From : https://leetcode.com/problems/house-robber/You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopp原创 2015-05-28 16:39:15 · 344 阅读 · 0 评论 -
[leetcode] Reverse Words in a String
From : https://leetcode.com/problems/reverse-words-in-a-string/Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".原创 2015-05-28 21:42:37 · 339 阅读 · 0 评论 -
[leetcode] Convert Sorted Array to Binary Search Tree
https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for a bi原创 2015-06-16 15:09:57 · 314 阅读 · 0 评论 -
[leetcode] Flatten Binary Tree to Linked List
From : https://leetcode.com/problems/flatten-binary-tree-to-linked-list/Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5原创 2015-06-17 15:56:02 · 298 阅读 · 0 评论 -
[leetcode] Reverse Integer
From: https://leetcode.com/problems/reverse-integer/Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321class Solution {public: int reverse(int原创 2015-05-29 10:21:13 · 314 阅读 · 0 评论 -
[leetcode] String to Integer
From : https://leetcode.com/problems/string-to-integer-atoi/Implement atoi to convert a string to an integer.class Solution {public: int myAtoi(string str) { int flag=3, cur, len原创 2015-05-30 17:52:34 · 326 阅读 · 0 评论 -
[leetcode] Binary Tree Level Order Traversal
From : https://leetcode.com/problems/binary-tree-level-order-traversal/Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).Fo原创 2015-05-31 15:12:52 · 302 阅读 · 0 评论 -
[leetcode] Contains Duplicate
From : https://leetcode.com/problems/contains-duplicate/Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice原创 2015-05-31 19:39:57 · 339 阅读 · 0 评论 -
[leetcode] Contains Duplicate II
From : https://leetcode.com/problems/contains-duplicate-ii/Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[原创 2015-05-31 15:25:15 · 319 阅读 · 0 评论 -
[leetcode] Best Time to Buy and Sell Stock
From : https://leetcode.com/problems/best-time-to-buy-and-sell-stock/Say 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 comp原创 2015-06-21 23:08:23 · 321 阅读 · 0 评论 -
[leetcode] Contains Duplicate III
From : https://leetcode.com/problems/contains-duplicate-iii/Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i原创 2015-06-02 21:15:30 · 597 阅读 · 0 评论 -
[leetcode] Roman to Integer
From : https://leetcode.com/problems/roman-to-integer/Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.class Solution {public:原创 2015-06-02 22:48:24 · 418 阅读 · 2 评论 -
【leetcode】 Bitwise AND of Numbers Range
From: https://leetcode.com/problems/bitwise-and-of-numbers-range/Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4.Solution 1:public class Solution {原创 2015-06-01 22:03:39 · 350 阅读 · 0 评论 -
[leecode] Longest Common Prefix
From : https://leetcode.com/problems/longest-common-prefix/Write a function to find the longest common prefix string amongst an array of strings.class Solution {public: string longestCommon原创 2015-06-02 10:06:50 · 332 阅读 · 0 评论 -
[leetcode] Best Time to Buy and Sell Stock II
From : https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/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 m原创 2015-06-21 22:35:06 · 293 阅读 · 0 评论 -
[leetcode] Maximum Depth of Binary Tree
From : https://leetcode.com/problems/maximum-depth-of-binary-tree/Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root no原创 2015-06-07 15:23:53 · 321 阅读 · 0 评论 -
【leetcode】 Combination Sum III
From : https://leetcode.com/problems/combination-sum-iii/Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combin原创 2015-06-02 19:44:25 · 315 阅读 · 0 评论 -
[leetcode] Palindrome Number
From : https://leetcode.com/problems/palindrome-number/Determine whether an integer is a palindrome. Do this without extra space.class Solution {public: bool isPalindrome(int x) { i原创 2015-06-01 16:05:37 · 312 阅读 · 0 评论 -
[leetcode] Majority Element
From : https://leetcode.com/problems/majority-element/Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may原创 2015-06-02 21:39:29 · 328 阅读 · 0 评论 -
[leetcode] Linked List Cycle
From : https://leetcode.com/problems/linked-list-cycle/Given a linked list, determine if it has a cycle in it./** * Definition for singly-linked list. * struct ListNode { * int val; *原创 2015-06-03 02:33:39 · 320 阅读 · 0 评论 -
[leetcode] Length of Last Word
From : https://leetcode.com/problems/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.原创 2015-06-03 03:45:58 · 315 阅读 · 0 评论 -
[leetcode] Minimum Size Subarray Sum
From : https://leetcode.com/problems/minimum-size-subarray-sum/Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If ther原创 2015-06-01 20:39:09 · 279 阅读 · 0 评论 -
[leetcode] Course Schedule II
From : https://leetcode.com/problems/course-schedule-ii/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 take co原创 2015-06-23 15:41:53 · 321 阅读 · 0 评论 -
[leetcode] Basic Calculator II
From : https://leetcode.com/problems/basic-calculator-ii/Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *,原创 2015-06-22 20:44:05 · 441 阅读 · 0 评论 -
【Course Schedule】Course Schedule
From : 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 take course原创 2015-06-22 22:42:51 · 393 阅读 · 0 评论 -
[leetcode] Maximum Subarray
From : https://leetcode.com/problems/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原创 2015-06-24 19:00:25 · 296 阅读 · 0 评论 -
[leetcode] Generate Parentheses
From : https://leetcode.com/problems/generate-parentheses/Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a s原创 2015-06-24 12:42:09 · 324 阅读 · 0 评论 -
[leetcode] Unique Paths
From : https://leetcode.com/problems/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原创 2015-06-24 20:43:42 · 328 阅读 · 0 评论 -
[leetcode] Swap Nodes in Pairs
From : https://leetcode.com/problems/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原创 2015-06-25 08:29:38 · 326 阅读 · 0 评论 -
[leetcode] Excel Sheet Column Title
From : https://leetcode.com/problems/excel-sheet-column-title/Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B原创 2015-06-04 23:03:00 · 332 阅读 · 0 评论 -
[leetcode] Gray Code
From : https://leetcode.com/problems/gray-code/The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the tot原创 2015-06-24 14:51:17 · 353 阅读 · 0 评论 -
[leetcode] Set Matrix Zeroes
From : https://leetcode.com/problems/set-matrix-zeroes/Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Solution:常数空间:1.考虑是不是固定数量的几个变量能搞定2.考虑是原创 2015-06-25 20:52:41 · 328 阅读 · 0 评论 -
红黑树基本操作
From : http://blog.csdn.net/eric491179912/article/details/6179908#t0介绍另一种平衡二叉树:红黑树(Red Black Tree),红黑树由Rudolf Bayer于1972年发明,当时被称为平衡二叉B树(symmetric binary B-trees),1978年被Leonidas J. Guibas 和Robe转载 2015-06-04 20:06:08 · 442 阅读 · 0 评论 -
[leetcode] 3Sum Closest
From : https://leetcode.com/problems/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 int原创 2015-06-06 10:12:12 · 319 阅读 · 0 评论 -
[leetcode] Summary Ranges
From : https://leetcode.com/problems/summary-ranges/Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5",原创 2015-06-27 01:54:12 · 338 阅读 · 0 评论 -
[leetcode] Min Stack
From : https://leetcode.com/problems/min-stack/Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() --原创 2015-06-06 13:51:08 · 289 阅读 · 0 评论