收集些Windows上的快捷操作。

之前用Python做爬虫经常用到正则表达式，有必要做一下关于正则表达式的笔记。

Description

There are n coins with different value in a line. Two players take turns to take one or two coins from left side until there are no more coins left. The player who take the coins with the most value wins.

Could you please decide the first player will win or lose?

Examples

Given A = [1,2,2], return true.

Given A = [1,2,4], return false.

原本并没有重视这个技巧，但是后来回过头再来做几道关于DP的题目，意外地发现这个做法可以将O(n^2)的复杂度优化至O(n)！所以打算将这类题目做一个总结吧。

直方图最大矩形覆盖

Description

Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

For example, given height = [2,1,5,6,2,3].