随笔分类 -  ~~Leetcode~~

上一页 1 2 3 4 5 6 7 下一页
Leetcode Longest Common Prefix
摘要：Write a function to find the longest common prefix string amongst an array of strings.class Solution {public: string longestCommonPrefix(vector &st... 阅读全文
posted @ 2014-07-03 17:19 OpenSoucre 阅读(152) 评论(0) 推荐(0)
Leetcode Search for a Range
摘要：Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2014-07-03 16:59 OpenSoucre 阅读(180) 评论(0) 推荐(0)
Leetcode Construct Binary Tree from Inorder and Postorder Traversal
摘要：Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.class Solution... 阅读全文
posted @ 2014-07-02 21:45 OpenSoucre 阅读(254) 评论(0) 推荐(0)
Leetcode Construct Binary Tree from Preorder and Inorder Traversal
摘要：Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.此题目有两种解决思路：1）递归... 阅读全文
posted @ 2014-07-02 21:23 OpenSoucre 阅读(180) 评论(0) 推荐(0)
Leetcode Populating Next Right Pointers in Each Node II
摘要：Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution stil... 阅读全文
posted @ 2014-07-02 20:53 OpenSoucre 阅读(196) 评论(0) 推荐(0)
Leetcode Flatten Binary Tree to Linked List
摘要：Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2014-07-02 20:00 OpenSoucre 阅读(215) 评论(0) 推荐(0)
Leetcode Search in Rotated Sorted Array II
摘要：Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to... 阅读全文
posted @ 2014-07-02 18:25 OpenSoucre 阅读(162) 评论(0) 推荐(0)
Leetcode Search 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 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文
posted @ 2014-07-02 18:14 OpenSoucre 阅读(167) 评论(0) 推荐(0)
Leetcode Integer to Roman
摘要：Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.int key[]={1000, 900, 500, 400, 100,90, 50, ... 阅读全文
posted @ 2014-07-02 17:54 OpenSoucre 阅读(155) 评论(0) 推荐(0)
Leetcode Merge k Sorted Lists
摘要：Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.合并k个排序列表解题思路是：取出 k个元素进行堆排序，每次取出最小的元素，插入链表中即可注意本题利用了c++... 阅读全文
posted @ 2014-07-01 23:17 OpenSoucre 阅读(613) 评论(0) 推荐(0)
Leetcode Partition List
摘要：Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-07-01 21:41 OpenSoucre 阅读(154) 评论(0) 推荐(0)
Leetcode Binary Tree Maximum Path Sum
摘要：Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-07-01 21:20 OpenSoucre 阅读(174) 评论(0) 推荐(0)
Leetcode Unique Binary Search Trees
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2014-07-01 20:52 OpenSoucre 阅读(206) 评论(0) 推荐(0)
Leetcode Path Sum II
摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2014-07-01 20:12 OpenSoucre 阅读(173) 评论(0) 推荐(0)
Leetcode Path Sum
摘要：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.Fo... 阅读全文
posted @ 2014-07-01 19:41 OpenSoucre 阅读(214) 评论(0) 推荐(0)
Leetcode Binary Tree Inorder Traversal
摘要：Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2014-07-01 18:46 OpenSoucre 阅读(127) 评论(0) 推荐(0)
Leetcode Spiral Matrix
摘要：Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ],... 阅读全文
posted @ 2014-06-29 17:53 OpenSoucre 阅读(203) 评论(0) 推荐(0)
Leetcode Sqrt(x)
摘要：参考Babylonian method（x0 越接近S的平方根越好）class Solution {public: int sqrt(double x) { if(x == 0) return 0; double root = x/2, tolerance = 1.... 阅读全文
posted @ 2014-06-29 17:30 OpenSoucre 阅读(204) 评论(0) 推荐(0)
Leetcode Pow(x,n)
摘要：Implement pow(x,n).明显的二分解决由于n不可能总是偶数， 如果n是正奇数，那么n个x的乘积等于两部分的乘积再乘以x 如果n是负奇数，那么n个x的乘积等于两部分乘积再乘以1/xclass Solution {public: double pow(double x, int ... 阅读全文
posted @ 2014-06-29 16:45 OpenSoucre 阅读(175) 评论(0) 推荐(0)
Leetcode Rotate Image
摘要：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?矩阵的旋转如1 2 34 5 67 8... 阅读全文
posted @ 2014-06-29 16:34 OpenSoucre 阅读(169) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 下一页