2016年10月28日

摘要: 122. Best Time to Buy and Sell Stock II Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to 阅读全文
posted @ 2016-10-28 23:59 渡江云 阅读(334) 评论(0) 推荐(0) 编辑
摘要: 121. Best Time to Buy and Sell Stock Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitte 阅读全文
posted @ 2016-10-28 23:45 渡江云 阅读(299) 评论(0) 推荐(0) 编辑
摘要: 110.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 bina 阅读全文
posted @ 2016-10-28 23:30 渡江云 阅读(104) 评论(0) 推荐(0) 编辑
摘要: 顺便把之前做过的一个简单难度的题也贴上来吧 67. Add Binary Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". 这种问题 阅读全文
posted @ 2016-10-28 16:57 渡江云 阅读(228) 评论(0) 推荐(0) 编辑
摘要: 18. 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 a 阅读全文
posted @ 2016-10-28 16:02 渡江云 阅读(321) 评论(0) 推荐(0) 编辑
摘要: 15. 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 th 阅读全文
posted @ 2016-10-28 15:39 渡江云 阅读(143) 评论(0) 推荐(0) 编辑
摘要: 16.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 阅读全文
posted @ 2016-10-28 14:40 渡江云 阅读(187) 评论(0) 推荐(0) 编辑
摘要: 最近弄Ceph集群考虑要不要加入分层存储 因此花了点时间研究了下 1,首先肯定要弄清Ceph分层存储的结构 ,结构图大概就是下图所示 缓存层(A cache tier)为Ceph客户端提供更好的I/O性能,而数据存储在存储层(a backing storage tier)。用相对快速/昂贵的设备(比 阅读全文
posted @ 2016-10-28 13:53 渡江云 阅读(2801) 评论(0) 推荐(0) 编辑

导航