2016年6月3日
斯坦福公开课ML第四讲
摘要： 阅读全文
posted @ 2016-06-03 21:03 Black_Knight 阅读(82) 评论(0) 推荐(0) 编辑
LeetCode OJ 153. Find Minimum in Rotated Sorted Array
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. 阅读全文
posted @ 2016-06-03 10:16 Black_Knight 阅读(242) 评论(0) 推荐(0) 编辑
LeetCode OJ 78. Subsets
摘要： Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must 阅读全文
posted @ 2016-06-03 09:26 Black_Knight 阅读(551) 评论(0) 推荐(0) 编辑