class Solution {
public:
void moveZeroes(vector<int>& nums){
int left =0;
int right =0;
if(nums.size()==1)return;
while(right<nums.size()){
if(nums[right]){
swap(nums[left],nums[right]);
left++;}
right++;}}};
class Solution {
public:
int maxArea(vector<int>& height){
int left =0;
int right = height.size()-1;
int area =0;
int result =0;
while(left<right){
area =(right-left)*min(height[right],height[left]); //计算区域高度
result = max(area,result);
if(height[left]<height[right]) // 找下一个高边缘
left++;else
right--;}return result;}};