编程题day17

https://leetcode-cn.com/problems/container-with-most-water/description/

public static int findMax(int[] height){
//解法一：
//		int max=0;
//		for(int i=0;i<height.length;i++){
//			for(int j=i+1;j<height.length;j++){
//				int number=(j-i)*Integer.min(height[i],height[j]);
//				if(number>max){
//					max=number;
//				}
//			}
//		}380ms
//解法二：
		int start=0,end=height.length-1,number=0,max=0;
		while(start<end){
			if(height[start]<height[end]){
			number=(end-start)*height[start];
			}else{
				number=(end-start)*height[end];	
			}
			if(max<number){
				max=number;
			}
			if(height[start]<height[end]){
				start++;
			}else{
				end--;
			}
		}
		return max;//8ms
		
	}