移动零
class Solution { public void moveZeroes(int[] nums) { int n = nums.length; int slow = 0; int fast = 0; while (fast < n) { if (nums[fast] != 0) { nums[slow++] = nums[fast++]; } else { fast++; } } for (int i = slow; i < n; i++) { nums[i] = 0; } } }
盛最多水的容器
class Solution { public int maxArea(int[] height) { int l = 0; int r = height.length - 1; int res = 0; while (l < r) { if (height[l] < height[r]) { res = Math.max(res, height[l] * (r - l)); l++; } else { res = Math.max(res, height[r] * (r - l)); r--; } } return res; } }
标签:nums,int,res,fast,height,++,leetCode,指针 From: https://www.cnblogs.com/zrzct/p/18508169