Boostable

  博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

07 2014 档案

摘要:LeetCode: LRU CacheDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.... 阅读全文
posted @ 2014-07-28 22:36 Boostable 阅读(377) 评论(0) 推荐(0)

摘要:LeetCode: Insertion Sort ListSort a linked list using insertion sort.地址:https://oj.leetcode.com/problems/insertion-sort-list/算法:按题目的意思,采用插入排序对链表进行排序,时... 阅读全文
posted @ 2014-07-28 22:19 Boostable 阅读(203) 评论(0) 推荐(0)

摘要:LeetCode: Sort ListSort a linked list in O(n log n) time using constant space complexity.地址:https://oj.leetcode.com/problems/sort-list/算法:采用分治的思想,首先利用... 阅读全文
posted @ 2014-07-28 22:16 Boostable 阅读(216) 评论(0) 推荐(0)

摘要:LeetCode: Max Points on a LineGiven n points on a 2D plane, find the maximum number of points that lie on the same straight line.地址:https://oj.leetcod... 阅读全文
posted @ 2014-07-27 21:58 Boostable 阅读(288) 评论(0) 推荐(0)

摘要:LeetCode: Reverse Words in a String:Evaluate Reverse Polish NotationEvaluate the value of an arithmetic expression in Reverse Polish Notation.Valid op... 阅读全文
posted @ 2014-07-27 21:18 Boostable 阅读(180) 评论(0) 推荐(0)

摘要:LeetCode: Reverse Words in a StringGiven an input string, reverse the string word by word. For example,Given s = "the sky is blue",return "blue is sky... 阅读全文
posted @ 2014-07-27 21:07 Boostable 阅读(312) 评论(0) 推荐(0)

摘要:Foundations of Machine Learning: Rademacher complexity and VC-Dimension(2)(一) 增长函数(Growth function) 在引入增长函数之前,我们先介绍一个例子,这个例子会有助于理解增长函数这个东西。在input spac... 阅读全文
posted @ 2014-07-19 16:17 Boostable 阅读(2299) 评论(4) 推荐(0)

摘要:Foundations of Machine Learning: Rademacher complexity and VC-Dimension(1) 前面两篇文章中,我们在给出PAC-learnable定理时,都有一个前提假设,那就是 Hypothesis set 是有限的。但很明显,在实际中的假设... 阅读全文
posted @ 2014-07-17 21:46 Boostable 阅读(3233) 评论(0) 推荐(0)