摘要：
GBDT(Gradient Boosting Decision Tree)算法参考：http://blog.csdn.net/dark_scope/article/details/24863289 理解机器学习算法：http://blog.csdn.net/dark_scope/article/de 阅读全文
摘要：
题目描述： Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0. You may 阅读全文
摘要：
题目描述： Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4 阅读全文
摘要：
题目描述： Given a positive integer, return its corresponding column title as appear in an Excel sheet. For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> 阅读全文
摘要：
题目描述： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- 阅读全文