leetcode
文章平均质量分 63
leonordo
http://weibo.com/pkubrooks/home
展开
-
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: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2015-09-20 16:53:06 · 718 阅读 · 0 评论 -
Letter Combinations of a Phone Number
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.Input:Digi原创 2015-08-28 11:14:44 · 555 阅读 · 0 评论 -
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原创 2015-08-28 10:28:54 · 384 阅读 · 0 评论 -
3Sums
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c原创 2015-08-27 17:14:36 · 564 阅读 · 0 评论 -
Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.class Solution {public: string longestCommonPrefix(vector& strs) { if(strs.size() == 0)原创 2015-08-27 11:48:58 · 367 阅读 · 0 评论 -
Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.#include class Solution {public: int charToInt(const char roman){ s原创 2015-08-26 17:55:56 · 389 阅读 · 0 评论 -
Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2015-08-26 14:29:19 · 346 阅读 · 0 评论 -
Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.查表法:class Solution {public: string intToRoman(int num) { string roman原创 2015-08-26 15:40:58 · 542 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2015-08-24 16:05:43 · 404 阅读 · 0 评论 -
ZigZag Conversion
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原创 2015-08-24 14:09:30 · 534 阅读 · 0 评论 -
Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2015-08-31 15:15:03 · 367 阅读 · 0 评论 -
4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Element原创 2015-08-31 11:38:58 · 391 阅读 · 0 评论 -
Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2015-08-31 13:09:35 · 363 阅读 · 0 评论 -
Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.s原创 2015-09-18 13:55:30 · 531 阅读 · 0 评论 -
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原创 2015-09-18 11:46:32 · 527 阅读 · 0 评论 -
Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.Note:You may a原创 2015-09-08 15:16:58 · 519 阅读 · 0 评论 -
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?solution: two pointers, one pointer step 1, the other pointer step 2, find t原创 2015-09-08 18:39:40 · 453 阅读 · 0 评论 -
Binary Search Tree Iterator
Binary Search Tree Iterator原创 2015-09-06 15:57:47 · 409 阅读 · 0 评论 -
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原创 2015-09-06 12:15:29 · 411 阅读 · 0 评论 -
Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.solution: 这道题是merge 2 sorted linked lists的扩展,从2-》K的问题,很多可以化为分治法(divide and conquer)求解。假设每个list都是n长原创 2015-09-06 11:01:26 · 387 阅读 · 0 评论 -
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:"((()))", "(()())", "(())()", "()(())", "()()原创 2015-09-01 22:47:30 · 407 阅读 · 0 评论 -
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.solution: use recursive method.#include /** * Defin原创 2015-08-31 17:39:55 · 462 阅读 · 0 评论 -
Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.class Solution {public: bool isPalindrome(int x) { int inverseX = 0; int value = 0; if(x < 0){原创 2015-08-24 18:25:21 · 398 阅读 · 0 评论 -
String to Integer (atoi)
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 input ca原创 2015-08-24 17:53:56 · 429 阅读 · 0 评论 -
leetcode 之 Pascal's Triangle II
问题:Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?原创 2014-11-20 21:44:07 · 513 阅读 · 0 评论 -
leetcode 之 Pascal's Triangle
问题:Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]class Solution {原创 2014-11-20 20:51:08 · 396 阅读 · 0 评论 -
leetcode 之 Balanced Binary Tree
问题:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne原创 2014-11-25 20:40:12 · 434 阅读 · 0 评论 -
leetcode 之 Search Insert Position
问题:Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in t原创 2014-11-17 14:17:51 · 430 阅读 · 0 评论 -
leetcode 之 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() -- Removes the element on top of the stack.top(原创 2014-11-15 13:54:06 · 3738 阅读 · 1 评论 -
leetcode 之 Unique Binary Search Trees
问题:Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2原创 2014-11-15 12:14:01 · 554 阅读 · 0 评论 -
leetcode 之 Word Ladder
问题:Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermedia原创 2014-11-11 14:26:15 · 577 阅读 · 0 评论 -
Leetcode 之 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.原创 2014-11-10 11:27:19 · 401 阅读 · 0 评论 -
leetcode 之 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 node down to the farthest leaf node.方法一. 广度优先遍历, 利用队列,在每一层的结尾原创 2014-11-06 13:46:17 · 650 阅读 · 0 评论 -
leetcode 之Find Minimum in Rotated Sorted Array
问题: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).Find the minimum element.You may assume no duplicate e原创 2014-11-26 19:47:46 · 601 阅读 · 0 评论 -
leetcode 之Find Minimum in Rotated Sorted Array II
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).Find the minimum element.The array may contain duplicates.思原创 2014-11-26 20:10:26 · 547 阅读 · 0 评论 -
leetcode 之 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原创 2014-11-23 15:58:18 · 449 阅读 · 0 评论 -
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.Solution: 用二维矩阵p存储原创 2015-07-28 22:17:37 · 363 阅读 · 0 评论 -
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)).Solution: 求两个有序数组的中位数,采用分原创 2015-07-28 22:21:46 · 727 阅读 · 0 评论 -
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-07-08 22:07:16 · 506 阅读 · 0 评论 -
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-07-07 23:04:32 · 585 阅读 · 0 评论