Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret...
分类：
其他好文 时间：
2015-02-22 15:46:43
阅读次数：
121
Problem Description
Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb...
分类：
Web程序 时间：
2015-02-22 14:40:33
阅读次数：
227
【题意】：输入一个符号（加减乘除） 后边跟上两个操作数。输出结果，如果不是整数，保留两位小数。注意：The result should be rounded to 2 decimal places
If and only if it is not an integer.需要判断是不是整数，不是全部保留两位小数。
可以对整个字符串分割，或者采用一个char加两个int的输入。
【AC代码】：
...
分类：
其他好文 时间：
2015-02-22 12:17:16
阅读次数：
169
Guilt should only be a call to action.When we see that we "missed the mark"(the meaning of sin in the original biblical Greek) we only need to correct...
分类：
其他好文 时间：
2015-02-20 20:52:13
阅读次数：
165
Problem Description
FFZ's birthday is coming. GTY wants to give a gift to ZZF. He asked his gay friends what he should give to ZZF. One of them said, 'Nothing is more interesting than a number multis...
分类：
其他好文 时间：
2015-02-19 18:43:02
阅读次数：
219
Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni...
分类：
其他好文 时间：
2015-02-19 17:28:16
阅读次数：
140
ScrumMasters Should Not Also Be Product Owners（中文翻译） December 2, 2014 by Mike Cohn 翻译：2015.2.18 by ouyida3
分类：
其他好文 时间：
2015-02-18 16:23:15
阅读次数：
156
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.
get(key) - Get the value (will always be positive) of the key i...
分类：
系统相关 时间：
2015-02-17 09:13:46
阅读次数：
191
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is...
分类：
其他好文 时间：
2015-02-16 22:12:33
阅读次数：
157
Given an integern, return the number of trailing zeroes inn!.Note:Your solution should be in logarithmic time complexity.Credits:Special thanks to@tsf...
分类：
其他好文 时间：
2015-02-16 06:48:23
阅读次数：
124
