pehaps的专栏

leetcode Minimum Window SubstringGiven a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T =

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of t

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find tw

题目是这样的：有一个整数数组，请求出两两之差绝对值最小的值,记住，只要得出最小值即可，不需要求出是哪两个数。这题首先一看就很面熟，貌似此类的题很多了，数组的最大连续和，最小连续绝对值等等。O（N^2）的解法肯定是最基础的，不过面试一般这种解法都是无用的。解法一：一轮排序，然后两两相邻的依次相减，次解法也没什么难度。解法二：下面就开始找有没有O（n）的解法了，今天的重头戏就来了，

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 of ea

Decode WaysA message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, d

#include#include#includeusing namespace std;int enCon( long long n,long long m,long long v,long long k){ int times=0; if(m>=n) return 0; if((m-v)*k<=m) return -1;