摘要:
法一:暴力解法(超时) int maxArea(vector<int>& height) { int max = 0; for(int i = 0; i<height.size(); i++){ for(int j = i+1; j<height.size(); j++){ int minHeigh 阅读全文
摘要:
法一:暴力解法(超时) int maxArea(vector<int>& height) { int max = 0; for(int i = 0; i<height.size(); i++){ for(int j = i+1; j<height.size(); j++){ int minHeigh 阅读全文
|