纽约汉服社牛年春节节目录制准备，有舞狮的节目。第一次看现场的舞狮，狮子毛茸茸的看上去好可爱，想撸。那个小耳朵也会动，眼睛也会眨，啊啊啊啊萌死我了。而且感觉现场格外喜庆，开心。

Given a array of integers, every element appears m times except for one which appears n times. Find that single one.

Boyer–Moore string-search algorithm for pattern search and Boyer–Moore majority vote algorithm to find majority elements.

在长岛七年，十七岁到二十四。青涩懵懂稚嫩鲁莽，到如今，回家后爸妈总说觉得我成熟了，但我的内心依然还是那个稚童，只是学会了安静。那两个梦的时间已记不清楚，姑且算作是五岁与十五岁，按照这个规律来说也许很快我们就会再见。我不知道我内心的少年是否还坐着轮椅，但是我知道他一直都在。

我的初心，一直都在。

A way to find root of an integer that is faster than binary search.

O(n + k) to find the occurrence of a string within another string.

O(n) to find if a set of task with prerequest of other task can be done.

To find a longest palindrome in a string in linear time, an algorithm may take advantage of the following characteristics or observations about a palindrome and a sub-palindrome.

To find if a set of task with prerequest of other task can be done in linear time.

《诗经·邶风·绿衣》

绿兮衣兮，绿衣黄裳。心之忧矣，曷维其亡？

《越人歌》

山有木兮木有枝，心悦君兮君不知。

《诗经·周南·桃夭》

桃之夭夭，灼灼其华。之子于归，宜其室家。

《诗经·卫风·木瓜》

投我以木桃，报之以琼瑶。匪报也，永以为好也！

《诗经·郑风·有女同车》

有女同车，颜如舜华。 将翱将翔，佩玉琼琚。