Leetcode
文章平均质量分 63
walter1990
菜鸟
展开
-
Leetcode 236
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原创 2015-08-16 00:39:38 · 410 阅读 · 0 评论 -
Leetcode 228 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","7"].public class Solution228 { public List原创 2015-09-07 23:57:44 · 285 阅读 · 0 评论 -
Leetcode229 Majority Element II
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.public class Solution229 { public List原创 2015-09-04 22:53:48 · 283 阅读 · 0 评论 -
Leetcode226 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原创 2015-09-12 13:10:10 · 392 阅读 · 0 评论 -
leetcode 240 Search a 2D Matrix II
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 in ascending from left to right.Integers in原创 2015-07-25 23:35:07 · 468 阅读 · 0 评论 -
Leetcode 234 Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?public class Solution234 { public boolean compare(ListNode ans1, Lis原创 2015-08-23 14:57:09 · 352 阅读 · 0 评论 -
Leetcode 227 Basic Calculator II
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2015-09-12 00:11:49 · 376 阅读 · 0 评论 -
LeetCode239 Sliding Window Maximum
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window原创 2015-08-04 00:06:14 · 420 阅读 · 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原创 2015-08-22 23:34:46 · 318 阅读 · 0 评论 -
Leetcode233 Number of Digit One
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:Given n = 13,Return 6, because digit 1 occurred in the follow原创 2015-09-01 08:28:53 · 382 阅读 · 0 评论 -
leetcode 232 Implement Queue using Stacks
Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the element from in front of queue.peek() -- Get the front element.empty(原创 2015-09-01 22:42:21 · 302 阅读 · 0 评论 -
Leetcode231 Power of Two
Given an integer, write a function to determine if it is a power of two.public class Solution231 { public boolean isPowerOfTwo(int n) { if(n==1) return true; if(n%2 == 1) re原创 2015-09-01 23:08:00 · 289 阅读 · 0 评论 -
leetcode 1 Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2015-12-14 23:37:28 · 256 阅读 · 0 评论 -
Leetcode 2 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 single digit. Add the two numbers and return it as a link原创 2015-12-14 23:39:04 · 246 阅读 · 0 评论 -
Leetcode 3 Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For原创 2015-12-21 21:42:32 · 340 阅读 · 0 评论 -
Leetcode 004 Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Subscribe to see whic原创 2016-02-13 22:51:46 · 289 阅读 · 0 评论 -
leetcode Longest Palindromic Substring 005
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.Subscribe to see w原创 2016-03-20 13:59:30 · 249 阅读 · 0 评论 -
leetcode ZigZag Conversion 006
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2016-03-20 15:17:16 · 241 阅读 · 0 评论 -
leetcode Reverse Integer 007
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321class Solution { public: int reverse(int x) { const int MAXX = 0x7fffffff; int flag = 1;原创 2016-03-20 16:25:40 · 277 阅读 · 0 评论 -
leetcode String to Integer 008
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible inpu原创 2016-03-21 23:22:42 · 284 阅读 · 0 评论 -
016 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-04 20:31:48 · 231 阅读 · 0 评论 -
021 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Subscribe to see which companies asked this questio原创 2016-04-05 23:03:19 · 193 阅读 · 0 评论 -
022 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:"((()))", "(()())", "(())()", "()(())", "()()原创 2016-04-05 23:28:03 · 210 阅读 · 0 评论 -
024 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-06 21:15:41 · 256 阅读 · 0 评论 -
026 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 not allocate extra space for another array, you must do this in place with原创 2016-04-06 21:46:19 · 209 阅读 · 0 评论 -
leetcode Palindrome Number 009
Determine whether an integer is a palindrome. Do this without extra space.#include #include #include using namespace std;class Solution { public: bool isPalindrome(int x) { const in原创 2016-03-24 23:00:54 · 263 阅读 · 0 评论 -
027 Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.原创 2016-04-08 23:16:45 · 210 阅读 · 0 评论 -
leetcode 038 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-25 20:49:11 · 227 阅读 · 0 评论 -
leetcode 39 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-25 22:12:57 · 210 阅读 · 0 评论 -
leetcode 040 Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina原创 2016-04-26 12:31:20 · 263 阅读 · 0 评论 -
leetcode 043 Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note:The numbers can be arbitrarily large and are non-negative.Converting the input string to integ原创 2016-04-26 20:48:58 · 237 阅读 · 0 评论 -
leetcode 046 Permutations
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].原创 2016-04-27 21:28:51 · 257 阅读 · 0 评论 -
leetcode 089 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 total number of bits in the code, print the sequence of原创 2016-05-11 19:43:26 · 270 阅读 · 0 评论 -
leetcode 047 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].原创 2016-04-29 19:42:28 · 238 阅读 · 0 评论 -
leetcode 048 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?Subscribe to see which companies asked this que原创 2016-04-29 22:14:55 · 250 阅读 · 0 评论 -
leetcode 050 Pow(x, n)
Implement pow(x, n).Subscribe to see which companies asked this questionclass Solution {public: double myPow(double x, int n) { double ans = 1.0; double temp = x; bool flag =原创 2016-04-30 14:53:34 · 248 阅读 · 0 评论 -
leetcode 053 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 [4,−1,2,1] ha原创 2016-04-30 15:32:41 · 248 阅读 · 0 评论 -
leetcode 054 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:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You sho原创 2016-04-30 16:12:39 · 247 阅读 · 0 评论 -
leetcode 055 Jump Game
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.Determine i原创 2016-04-30 16:40:50 · 294 阅读 · 0 评论 -
leetcode 058 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-04-30 17:11:22 · 226 阅读 · 0 评论