摘要: lc 343 Integer Break [343 Integer Break][1] Given a positive integer n, break it into the sum of at least two positive integers and maximize the produ 阅读全文
posted @ 2017-12-12 00:57 三石宝宝 阅读(114) 评论(0) 推荐(0) 编辑
摘要: lc 646 Maximum Length of Pair Chain [646 Maximum Length of Pair Chain][1] You are given pairs of numbers. In every pair, the first number is always sm 阅读全文
posted @ 2017-12-07 15:17 三石宝宝 阅读(134) 评论(0) 推荐(0) 编辑
摘要: lc 312 Burst Balloons [312 Burst Balloons][1] Given balloons, indexed from to . Each balloon is painted with a number on it represented by array . You 阅读全文
posted @ 2017-12-03 23:50 三石宝宝 阅读(123) 评论(0) 推荐(0) 编辑
摘要: lc 118 Pascal's Triangle [118 Pascal's Triangle][1] Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Re 阅读全文
posted @ 2017-11-29 00:38 三石宝宝 阅读(120) 评论(0) 推荐(0) 编辑
摘要: negroni gzip源码简单分析解读 这是一个为Negroni设计的gzip压缩处理中间件,需要用到已有的compress中的gzip,阅读了不长的源码之后,总结了一些关键要点和注意点。 检查是否有潜在的已经被预先解码的但却不可用的response。在主体部分被写之前,要先写头。注意:Disca 阅读全文
posted @ 2017-11-23 22:22 三石宝宝 阅读(716) 评论(0) 推荐(0) 编辑
摘要: lc 712 Minimum ASCII Delete Sum for Two Strings [712 Minimum ASCII Delete Sum for Two Strings][1] Given two strings s1, s2, find the lowest ASCII sum 阅读全文
posted @ 2017-11-21 18:17 三石宝宝 阅读(252) 评论(0) 推荐(0) 编辑
摘要: lc 413 Arithmetic Slices [413 Arithmetic Slices][1] A sequence of number is called arithmetic if it consists of at least three elements and if the dif 阅读全文
posted @ 2017-11-16 16:24 三石宝宝 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 从源码对比DefaultServeMux 与 gorilla/mux DefaultServeMux Golang自带的net/http库中包含了DefaultServeMux方法,以此可以搭建一个稳定的高并发的web server。 DefaultServeMux源码分析 路由表是实现路由功能的重 阅读全文
posted @ 2017-11-12 13:14 三石宝宝 阅读(1149) 评论(0) 推荐(1) 编辑
摘要: lc 123 Best Time to Buy and Sell Stock III [123 Best Time to Buy and Sell Stock III][1] Say you have an array for which the ith element is the price o 阅读全文
posted @ 2017-11-10 15:35 三石宝宝 阅读(130) 评论(0) 推荐(0) 编辑
摘要: lc 70 Climbing Stairs [70 Climbing Stairs][1] You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 阅读全文
posted @ 2017-11-07 18:55 三石宝宝 阅读(132) 评论(0) 推荐(0) 编辑