weixin_44312010的博客

class Solution { public: int maxArea(vector<int>& height) { int water=0; int i=0; int j=height.size()-1; while(i<j) { int h=min(height[i],height[j]); water=max(water,(j-i)*h);

从零开始遍历 class Solution { public: string longestPalindrome(string s) { int length=s.size(); int maxlength=1; int l,r; int start=0; ///< recycle start reom zerom,which used twenty ms for(int i=0;i<leng

class Solution { public: int lengthOfLongestSubstring(string s) { /*unordered_set<char>occu; int j=-1; int ans=0; int length=s.size(); for(int i=0;i<length;++i) { if(i>0)