leetcode
文章平均质量分 65
RMCYork
这个作者很懒,什么都没留下…
展开
-
[Leetcode]Permutations and Permuations II
Permutations原创 2014-11-07 12:26:48 · 359 阅读 · 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,4], [原创 2014-11-05 12:05:50 · 371 阅读 · 0 评论 -
[Leetcode]Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.方法见上原创 2014-11-05 05:56:39 · 368 阅读 · 0 评论 -
3种解决searching string的方法
The fundamental string searching (matching) problem is defined as follows: given two strings - a text and a pattern, determine whether the pattern appears in the text. The problem is also known as "th转载 2014-11-05 03:43:49 · 1326 阅读 · 0 评论 -
[Leetcode]Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".原创 2014-11-05 02:42:33 · 445 阅读 · 0 评论 -
[Leetcode]Clone Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each原创 2014-11-20 07:21:23 · 333 阅读 · 0 评论 -
[Leetcode]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原创 2014-11-02 15:11:01 · 318 阅读 · 0 评论 -
[Leetcode]Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?原创 2014-11-03 04:13:50 · 261 阅读 · 0 评论 -
[Leetcode]Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.原创 2014-11-03 03:44:19 · 260 阅读 · 0 评论 -
[Leetcode]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原创 2014-11-05 12:24:12 · 310 阅读 · 0 评论 -
[Leetcode]Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2014-11-05 11:47:11 · 416 阅读 · 0 评论 -
[Leetcode]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原创 2014-11-02 15:46:17 · 324 阅读 · 0 评论 -
[Leetcode]Iterative preorder, inorder, postorder traversal
Postorder Traversal原创 2014-11-07 06:24:13 · 615 阅读 · 0 评论 -
[Leetcode]Path Sum&Path Sum II
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum原创 2014-11-03 01:51:19 · 316 阅读 · 0 评论 -
[Leetcode]3Sum
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原创 2014-11-06 13:23:42 · 392 阅读 · 0 评论 -
[Leetcode]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原创 2014-11-06 12:03:50 · 338 阅读 · 0 评论 -
[Leetcode]Word Break
Word Breakgiven a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",原创 2014-10-04 13:51:37 · 435 阅读 · 0 评论 -
[Leetcode]Convert Sorted Array & List to Binary Search Tree
Convert Sorted Array to Binary Search Tree原创 2014-11-07 08:03:05 · 564 阅读 · 0 评论 -
[Leetcode]Pow(x, n)
使用二分法实现可以使时间复杂度变为O(logn)原创 2014-11-07 07:03:00 · 307 阅读 · 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 never diffe原创 2014-11-03 02:11:25 · 337 阅读 · 0 评论 -
[Leetcode]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原创 2014-11-03 03:26:42 · 353 阅读 · 0 评论 -
[Leetcode]Populating Next Right Pointers in Each Node I && II
IGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next r原创 2014-11-20 02:01:43 · 387 阅读 · 0 评论 -
[Leetcode]Multiply Strings
这一题刚看吓坏了,看了yi xie wang shagn de原创 2014-11-01 13:07:43 · 266 阅读 · 0 评论 -
[Leetcode]Interleaving String
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 = "aadbbbaccc", ret原创 2014-11-02 07:08:40 · 262 阅读 · 0 评论 -
[Leetcode]Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node.原创 2014-11-06 14:17:26 · 402 阅读 · 0 评论 -
[Leetcode]Unique Binary Search Trees I & II
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 1 \原创 2014-11-07 09:04:55 · 347 阅读 · 0 评论 -
[Leetcode]Combinations & Permutations
先记录代码,回头写分析Com原创 2014-11-10 13:28:35 · 499 阅读 · 0 评论 -
[Leetcode]Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.这道题中zui zhong yao d原创 2014-11-10 02:45:57 · 491 阅读 · 0 评论 -
[Leetcode]Find Minimum in Rotated Sorted Array I & 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.You may assume no duplicate exists in原创 2014-10-21 02:13:12 · 354 阅读 · 0 评论 -
[Leetcode]Median of Two Sorted Arrays
There are two sorted arrays A and B 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)).转载 2014-11-09 15:20:40 · 416 阅读 · 0 评论 -
[Leetcode]sqrt(x)
牛顿迭代发:原创 2014-10-28 14:54:20 · 362 阅读 · 0 评论 -
[Leetcode]Triangle
TriangleGiven 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],原创 2014-10-07 14:43:54 · 306 阅读 · 0 评论 -
[Leetcode]Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3转载 2014-10-04 14:59:18 · 352 阅读 · 0 评论 -
[Leetcode]Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous原创 2014-10-31 06:22:36 · 375 阅读 · 0 评论 -
[Leetcode]Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2014-11-20 07:48:44 · 489 阅读 · 0 评论 -
[Leetcode]Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from原创 2014-11-03 03:08:56 · 258 阅读 · 0 评论 -
[Leetcode]Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.思路很简单,对所有在strs中的strings原创 2014-11-02 16:11:24 · 305 阅读 · 0 评论 -
[Leetcode]LeetCode Single Number II 位运算法解析理解
问题描述:Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it原创 2014-08-22 23:32:07 · 406 阅读 · 0 评论 -
[leetcode]分治法求解最大子序列问题——Java实现
问题描述: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原创 2014-08-27 19:45:03 · 1061 阅读 · 2 评论 -
[Leetcode]Integer与Roman的相互转换
罗马数字Roman表示方法:原创 2014-08-30 22:07:08 · 459 阅读 · 0 评论