osigmao的专栏

Sliding window类的题类似maximum subarray, maximum product subarray

public class Solution { public String longestPalindrome(String s) { if (s == null) return null; int max = 0; String maxSub = ""; for (int beg = 0; beg < s.length();

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.Above is a histogram where width o

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:

最值问题的第二种思路，保存局部最优，更新全局最优求P