01 2015 档案

LeetCode: Unique Binary Search Trees II 解题报告
摘要：Unique Binary Search Trees IIGiven n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, yo... 阅读全文

posted @ 2015-01-28 16:40 Yu's Garden 阅读(2427) 评论(0) 推荐(1)

【面经】Epic: 数据库去重
摘要：题目是：有2个10G的数据库，存储了一些string. 2者之间有一些重复的数据。请把它们合并为一个数据库，并且去除重复。限制：内存是4G例如: DB1: cmu, ucb, stanford, nyu DB2: ucsb, ucb, ucsd, cmu.两者合并后，应该是: DB: cmu,... 阅读全文

posted @ 2015-01-23 17:23 Yu's Garden 阅读(1541) 评论(0) 推荐(1)

Google 面试题：Java实现用最大堆和最小堆查找中位数 Find median with min heap and max heap in Java
摘要：Google面试题股市上一个股票的价格从开市开始是不停的变化的，需要开发一个系统，给定一个股票，它能实时显示从开市到当前时间的这个股票的价格的中位数（中值）。SOLUTION 1:1.维持两个heap,一个是最小堆，一个是最大堆。2.一直使maxHeap的size大于minHeap.3. 当两边si... 阅读全文

posted @ 2015-01-23 08:12 Yu's Garden 阅读(4242) 评论(0) 推荐(0)

LeetCode: Largest Number 解题报告 以及Comparator, CompareTo 应用
摘要：Largest NumberGiven a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the lar... 阅读全文

posted @ 2015-01-20 09:47 Yu's Garden 阅读(5075) 评论(0) 推荐(1)

LeetCode: Permutation Sequence 解题报告
摘要：PermutationSequence https://oj.leetcode.com/problems/permutation-sequence/The set [1,2,3,…,n] contains a total of n! unique permutations.By listing a... 阅读全文

posted @ 2015-01-14 18:03 Yu's Garden 阅读(1343) 评论(0) 推荐(0)

LeetCode: Next Permutation 解题报告
摘要：Next PermutationImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangemen... 阅读全文

posted @ 2015-01-13 17:58 Yu's Garden 阅读(972) 评论(0) 推荐(0)

LeetCode: Subsets 解题报告
摘要：SubsetsGiven a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set mus... 阅读全文

posted @ 2015-01-08 20:05 Yu's Garden 阅读(9959) 评论(1) 推荐(0)

LeetCode: Recover Binary Search Tree 解题报告
摘要：Recover Binary Search TreeTwo elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A sol... 阅读全文

posted @ 2015-01-07 14:06 Yu's Garden 阅读(2700) 评论(0) 推荐(0)

LeetCode: Find Peak Element 解题报告
摘要：Find Peak ElementA peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and ... 阅读全文

posted @ 2015-01-05 01:55 Yu's Garden 阅读(957) 评论(0) 推荐(0)

LeetCode: Valid Parentheses 解题报告
摘要：Valid ParenthesesGiven a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must clos... 阅读全文

posted @ 2015-01-04 21:49 Yu's Garden 阅读(659) 评论(0) 推荐(0)

LeetCode: First Missing Positive 解题报告
摘要：First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given[1,2,0]return3,and[3,4,-1,1]return2.Yo... 阅读全文

posted @ 2015-01-03 22:45 Yu's Garden 阅读(5264) 评论(4) 推荐(0)

LeetCode: Best Time to Buy and Sell Stock III 解题报告
摘要：Best Time to Buy and Sell Stock IIIQuestion SolutionSay you have an array for which the ith element is the price of a given stock on day i.Design an a... 阅读全文

posted @ 2015-01-03 18:51 Yu's Garden 阅读(800) 评论(0) 推荐(0)

LeetCode: Best Time to Buy and Sell Stock II 解题报告
摘要：Best Time to Buy and Sell Stock IIQuestion SolutionSay you have an array for which the ith element is the price of a given stock on day i.Design an al... 阅读全文

posted @ 2015-01-03 18:39 Yu's Garden 阅读(627) 评论(0) 推荐(0)

LeetCode: Best Time to Buy and Sell Stock 解题报告
摘要：Best Time to Buy and Sell StockSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to compl... 阅读全文

posted @ 2015-01-03 18:34 Yu's Garden 阅读(528) 评论(0) 推荐(0)

【转载】一个Sqrt函数引发的血案
摘要：转自：http://www.cnblogs.com/pkuoliver/archive/2010/10/06/sotry-about-sqrt.html源码下载地址：http://diducoder.com/sotry-about-sqrt.html好吧，我承认我标题党了，不过既然你来了，就认真看下... 阅读全文

posted @ 2015-01-03 16:44 Yu's Garden 阅读(445) 评论(0) 推荐(0)

LeetCode: Construct Binary Tree from Inorder and Postorder Traversal 解题报告
摘要：Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assu... 阅读全文

posted @ 2015-01-03 16:36 Yu's Garden 阅读(382) 评论(0) 推荐(0)

Lintcode:Longest Common Subsequence 解题报告
摘要：Longest Common Subsequence原题链接：http://lintcode.com/zh-cn/problem/longest-common-subsequence/Given two strings, find the longest comment subsequence (L... 阅读全文

posted @ 2015-01-03 15:00 Yu's Garden 阅读(3911) 评论(0) 推荐(0)

Lintcode: Longest Common Substring 解题报告
摘要：Longest Common Substring原题链接：http://lintcode.com/zh-cn/problem/longest-common-substring/#Given two strings, find the longest common substring.Return t... 阅读全文

posted @ 2015-01-03 14:32 Yu's Garden 阅读(2987) 评论(0) 推荐(0)

LeetCode: Construct Binary Tree from Preorder and Inorder Traversal 解题报告
摘要：Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume... 阅读全文

posted @ 2015-01-03 00:39 Yu's Garden 阅读(381) 评论(0) 推荐(0)

LeetCode:Sqrt(x) 解题报告
摘要：Sqrt(x)Implementint sqrt(int x).Compute and return the square root ofx.SOLUTION 1:参见：二分法总结，以及模板：http://t.cn/RZGkPQc 1 public class Solution { 2 pu... 阅读全文

posted @ 2015-01-02 22:59 Yu's Garden 阅读(2202) 评论(0) 推荐(0)

总结： Sort 排序算法
摘要：排序总结面试经验硅谷某前沿小Startup面试时，问到的一个题目就是写一个快速排序算法。进而面试官问到了各种算法的算法复杂度，进而又问了Merge Sort 与 QuickSort 的优劣。对排序算法的全面理解，体现了计算机学生的功底。现在来讲Merge Sort 与Quick Sort 是最流行的... 阅读全文

posted @ 2015-01-02 22:39 Yu's Garden 阅读(5664) 评论(0) 推荐(0)

总结：二分法题目汇总 以及二分法模板
摘要：二分法模板: 1 while (l A[l]) {11 l = m;12 } else {13 r = m;14 }15 } 相关二分法题目链接：L... 阅读全文

posted @ 2015-01-02 22:07 Yu's Garden 阅读(3781) 评论(0) 推荐(0)

LeetCode: Search in Rotated Sorted Array II 解题报告
摘要：Search in Rotated Sorted Array IIFollow up for "LeetCode: Search in Rotated Sorted Array 解题报告":What ifduplicatesare allowed?Would this affect the run-... 阅读全文

posted @ 2015-01-01 20:34 Yu's Garden 阅读(740) 评论(0) 推荐(0)

LeetCode: Search in Rotated Sorted Array 解题报告
摘要：Search in Rotated Sorted ArraySuppose 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).... 阅读全文

posted @ 2015-01-01 20:23 Yu's Garden 阅读(945) 评论(0) 推荐(0)

LeetCode: Binary Search Tree Iterator 解题报告
摘要：Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Callin... 阅读全文

posted @ 2015-01-01 16:42 Yu's Garden 阅读(5724) 评论(0) 推荐(0)

LeetCode: Search Insert Position 解题报告
摘要：Search Insert PositionGiven 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 ... 阅读全文

posted @ 2015-01-01 00:17 Yu's Garden 阅读(588) 评论(0) 推荐(0)

导航