2017 年 10月 8 日随笔档案 - keepshuatishuati

2017年10月8日

摘要： Resevior Sampling : https://en.wikipedia.org/wiki/Reservoir_sampling 阅读全文

posted @ 2017-10-08 16:59 keepshuatishuati 阅读(100) 评论(0) 推荐(0) 编辑

摘要： Note: 1. Find a increasing digits number. It's kind of longest increasing subsequence but with fixed size. 2. Remember to remove the zeros from beginn 阅读全文

posted @ 2017-10-08 16:24 keepshuatishuati 阅读(109) 评论(0) 推荐(0) 编辑

LeetCode 406: Queue Reconstruction

摘要： This is SO AWESOME solution. 阅读全文

posted @ 2017-10-08 16:02 keepshuatishuati 阅读(115) 评论(0) 推荐(0) 编辑

LeetCode 409: Valid Word Abbreviation

摘要： Note: 1. 0 could be 10 but not valid for 01. Check edge cases. 2. No number shoud be there as num reduced. 阅读全文

posted @ 2017-10-08 15:40 keepshuatishuati 阅读(142) 评论(0) 推荐(0) 编辑