leetcode
文章平均质量分 62
Neo_邪风
这个作者很懒,什么都没留下…
展开
-
Leetcode-252.Meeting Rooms
Problem Description:Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), determine if a person could attend all meetings.For example, Given [[0, 30原创 2016-01-16 04:35:00 · 410 阅读 · 0 评论 -
Leetcode-39.Combination Sum
Problem description : 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 fro原创 2015-12-27 04:35:12 · 231 阅读 · 0 评论 -
C++.OOP
Object Oriented Programming (OOP) is a programming paradigm where the complete software operates as a bunch of objects talking to each otherWhat are main features of OOP? Encapsulation Polymorphism原创 2015-12-27 00:46:52 · 220 阅读 · 0 评论 -
Leetcode-17.Letter Combinations of a Phone Number
Problem description: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below.I原创 2015-12-26 11:28:00 · 255 阅读 · 0 评论 -
Leetcode-159.Longest Substring with At Most Two Distinct Characters
Problem DescriptionGiven a string, find the length of the longest substring T that contains at most 2 distinct characters.For example, Given s = “eceba”,T is “ece” which its length is 3. Analysis: We原创 2016-01-10 04:11:10 · 397 阅读 · 0 评论 -
Leetcode-22.Generate Parentheses
Problem description: 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-12-25 07:32:41 · 223 阅读 · 0 评论 -
leetcode-156.Binary Tree Upside Down
Problem Description: Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a原创 2015-12-25 04:42:22 · 222 阅读 · 0 评论 -
Leetcode - 266. Palindrome Permutation
Problem Description: Given a string, determine if a permutation of the string could form a palindrome.For example, “code” -> False, “aab” -> True, “carerac” -> True. Hint: Consider the palindromes原创 2016-01-26 10:16:06 · 430 阅读 · 0 评论 -
Leetcode-159.Longest Substring with At Most Two Distinct Characters
Problem Description: Given a string, find the length of the longest substring T that contains at most 2 distinct characters.For example, Given s = “eceba”, T is “ece” which its length is 3.Analysis:原创 2015-12-24 11:55:48 · 264 阅读 · 0 评论 -
Leetcode-14. Longest Common Prefix
Problem Description: Write a function to find the longest common prefix string amongst an array of strings.Analysis: It’s an easy problem. First pieces of code is regular solution. I try to use Trie原创 2016-01-08 11:20:14 · 380 阅读 · 0 评论 -
Leetcode - 146. LRU Cache
Problem Description: 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 positiv原创 2016-01-25 06:24:14 · 245 阅读 · 0 评论 -
Leetcode - 261. Graph Valid Tree
Problem description: Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.For example原创 2016-01-25 03:41:00 · 474 阅读 · 0 评论 -
Leetcode-80.Remove Duplicates from Sorted Array II
Problem description: Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3], Your function should return length = 5,原创 2015-12-23 10:01:39 · 220 阅读 · 0 评论 -
Leetcode-28.Implement strStr()
Problem description: Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Analysis: A classical problem with different ways to s原创 2015-12-27 05:56:56 · 359 阅读 · 0 评论 -
Leetcode-224.Basic Calculator
Problem Description: Implement a basic calculator to evaluate a simple expression string. The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative原创 2015-12-28 04:11:57 · 236 阅读 · 0 评论 -
Leetcode - 215.Kth Largest Element in an Array.
Problem Description : Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example, Given [3,2,1,5,6,4] and原创 2016-03-06 14:45:17 · 349 阅读 · 0 评论 -
Leetcode - 287. Find the Duplicate Number
Problem Description: Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one原创 2016-03-05 09:03:29 · 353 阅读 · 0 评论 -
Leetcode- 241.Different Ways to Add Parentheses
Problem Description : Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, -原创 2016-02-19 06:31:38 · 335 阅读 · 0 评论 -
Leetcode-300.Longest Increasing Subsequence
//Problem description: Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [原创 2015-12-26 00:07:21 · 246 阅读 · 0 评论 -
Leetcode - 295. Find Median From Data Stream
Problem Description Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,原创 2016-02-03 06:54:54 · 354 阅读 · 0 评论 -
Leetcode-246.Strobogrammatic Number
Problem Description: A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).Write a function to determine if a number is strobogrammatic. The number原创 2016-01-15 11:14:11 · 384 阅读 · 0 评论 -
Leetcode-245.Shortest Word Distance
Problem Description:This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different paramet原创 2016-01-15 10:54:13 · 310 阅读 · 0 评论 -
Leetcode - 285.Inorder Successor in BST
Problem Description: Given a binary search tree and a node in it, find the in-order successor of that node in the BST.Note: If the given node has no in-order successor in the tree, return null.Analysi原创 2016-02-02 03:52:40 · 394 阅读 · 0 评论 -
Leetcode-231.Flatten 2D Vector
Problem Description: Implement an iterator to flatten a 2d vector.For example, Given 2d vector =[ [1,2], [3], [4,5,6] ] By calling next repeatedly until hasNext returns false, the order of原创 2016-01-15 04:52:31 · 291 阅读 · 0 评论 -
Leetcode-241.Different Ways to Add Parentheses
Problem Description: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - an原创 2016-01-13 23:22:19 · 272 阅读 · 0 评论 -
Leetcode-33.Search in Rotated Sorted Array.
Problem description: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the原创 2016-01-13 04:13:28 · 266 阅读 · 0 评论 -
Leetcode - 144. Binary Tree Traversal
Problem: Given a binary tree, return the preorder, inorder, postorder traversal of its nodes’ values.Preorder :Recursive :vector<int> preorderTraversal(TreeNode* root) { vector<int> res; help原创 2016-02-10 11:07:39 · 289 阅读 · 0 评论 -
Leetcode -229. Majority Element
Problem Description: Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.Analysis: Moore Voting Algorith原创 2016-01-24 04:22:22 · 227 阅读 · 0 评论 -
Leetcode.179 Largest Number
Problem description : Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. Note: Th原创 2015-12-23 06:25:31 · 254 阅读 · 0 评论 -
Leetcode-65.Valid Number
Problem Description: Validate if a given string is numeric.Some examples: “0” => true ” 0.1 ” => true “abc” => false “1 a” => false “2e10” => trueAnalysis: This link provides a nicely systemati原创 2016-01-07 05:53:36 · 251 阅读 · 0 评论 -
Leetcode-163.Missing Ranges
Problem Description:Given a sorted integer array where the range of elements are [lower, upper] inclusive, return its missing ranges.For example, given [0, 1, 3, 50, 75], lower = 0 and upper = 99, retu原创 2015-12-31 03:49:33 · 301 阅读 · 0 评论 -
Leetcode - 97.Interleaving String
Problem description: 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 = “aad原创 2016-01-18 05:27:21 · 245 阅读 · 0 评论 -
Leetcode-54.Spiral Matrix
Problem Description: 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 ]原创 2016-01-17 10:24:06 · 370 阅读 · 0 评论 -
Leetcode-166.Fraction to Recurring Decimal
Problem Description: Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating part原创 2015-12-30 12:54:37 · 188 阅读 · 0 评论 -
Leetcode-151.Reverse Words in a String
Problem Description: Given an input string, reverse the string word by word.For example, Given s = ” the sky is blue “, return “blue is sky the”.Analysis: This is probably by far the most common原创 2015-12-30 03:42:26 · 219 阅读 · 0 评论 -
Leetcode-187.Repeated DNA Sequences
Problem Description: All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: “ACGAATTCCG”. When studying DNA, it is sometimes useful to identify repeated sequences w原创 2015-12-29 11:54:51 · 262 阅读 · 0 评论 -
Leetcode-127.Word Ladder
Problem description : Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter c原创 2015-12-29 04:53:19 · 286 阅读 · 0 评论 -
Leetcode-134.Gas Station
Problem Description: There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel fro原创 2015-12-28 06:16:26 · 259 阅读 · 0 评论 -
Leetcode-227.Basic Calculator II
Problem Description: Implement a basic calculator to evaluate a simple expression string. The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The intege原创 2015-12-28 00:47:23 · 236 阅读 · 0 评论 -
Binary Search
1.Easy binary search in a sort array without duplicate elementsint left=0;right=arr.size()-1;while(left <= right)//<= { int mid = left + ((right-left)>>1); int mid = left + (right原创 2015-09-28 04:58:34 · 226 阅读 · 0 评论