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

2015年1月3日

摘要: 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 阅读(620) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(518) 评论(0) 推荐(0) 编辑
摘要: 转自: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 阅读(439) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(376) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(3902) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(2976) 评论(0) 推荐(0) 编辑
摘要: 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 阅读(372) 评论(0) 推荐(0) 编辑

2015年1月2日

摘要: 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 阅读(2188) 评论(0) 推荐(0) 编辑
摘要: 排序总结面试经验硅谷某前沿小Startup面试时,问到的一个题目就是写一个快速排序算法。进而面试官问到了各种算法的算法复杂度,进而又问了Merge Sort 与 QuickSort 的优劣。对排序算法的全面理解,体现了计算机学生的功底。现在来讲Merge Sort 与Quick Sort 是最流行的... 阅读全文
posted @ 2015-01-02 22:39 Yu's Garden 阅读(5576) 评论(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 阅读(3730) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 17 下一页

导航