摘要: https://drive.google.com/drive/folders/0B9Fj5-El2B6lQ1VjTjlHekRqbzA 阅读全文
posted @ 2017-09-14 23:14 Gryffin 阅读(149) 评论(0) 推荐(0) 编辑
摘要: https://instant.1point3acres.com/thread/190699 觉得先subset选n个位子,再一个个subset挑剩下的位子,再乘以n!还没试 阅读全文
posted @ 2017-09-14 23:05 Gryffin 阅读(234) 评论(0) 推荐(0) 编辑
摘要: http://www.1point3acres.com/bbs/thread-204496-1-1.html 不bruteforce的话挺难的,想不出来怎么做 阅读全文
posted @ 2017-09-14 23:03 Gryffin 阅读(298) 评论(0) 推荐(0) 编辑
摘要: http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=206601&highlight=coursera%2BOA http://www.1point3acres.com/bbs/forum.php?mod=viewthread&t 阅读全文
posted @ 2017-09-14 23:02 Gryffin 阅读(290) 评论(0) 推荐(0) 编辑
摘要: http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=199644&ctid=512 https://leetcode.com/problems/count-numbers-with-unique-digits/discuss/ 阅读全文
posted @ 2017-09-14 11:20 Gryffin 阅读(247) 评论(0) 推荐(0) 编辑
摘要: http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=290417&ctid=512 leetcode convert Roman to Integer 阅读全文
posted @ 2017-09-14 10:59 Gryffin 阅读(602) 评论(0) 推荐(0) 编辑
摘要: Leetcode 上的题 Merge Intervals Insert Intervals Meeting Rooms Meeting RoomsII Topcoder tutorial: Sweep Line Algorithms some from gitbook about sweep lin 阅读全文
posted @ 2017-09-03 06:08 Gryffin 阅读(685) 评论(0) 推荐(0) 编辑
摘要: 三种方法: 1. 对每一个字符,从左右两边开始算 2. 动态规划 string input; int length = input.length(); int[][] r= new int[length][length]; for (int i = length - 1; i >= 0; i --) 阅读全文
posted @ 2017-05-05 02:36 Gryffin 阅读(116) 评论(0) 推荐(0) 编辑
摘要: 1. machine learning 问题的分类: Supervised Learning: right answers given in samples Regression: continuous result Classification: discrete valued output Un 阅读全文
posted @ 2017-04-10 10:58 Gryffin 阅读(127) 评论(0) 推荐(0) 编辑
摘要: 1. Creating and running a thread: (1) a class implements Runnable (2) override run() (3) start the thread by :(new Thread(new RunnableClass())).start( 阅读全文
posted @ 2017-02-21 11:52 Gryffin 阅读(187) 评论(0) 推荐(0) 编辑