chen

这是本人在研究leetcode中Median of Two Sorted Arrays一题目的时候看到一篇文章，觉得非常好，其中对快速排序重新实现。 文章来源于http://www.geeksforgeeks.org/这个网站。 We recommend to read following post as a prerequisite of this post. K’th Sma

Implement regular expression matching with support for ‘.’ and ‘*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cover the

Given a string S, find the longest palindromic substring in S. Note: This is Part II of the article: Longest Palindromic Substring. Here, we describe an algorithm (Manacher’s algorithm) which

This interesting problem has been featured in the famous Greplin programming challenge, and is asked quite often in the interviews. Why? Because this problem can be attacked in so many ways. There a