Zhbeii

摘要： https://leetcode-cn.com/problems/container-with-most-water/ 使用双指针 class Solution { public int maxArea(int[] height) { int i = 0, j = height.length - 1 阅读全文

摘要： https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/ 思路: int[][]的时候,二维数组.length返回的是数组的行数 把这个转化成图,搜索二叉树 class Solution { public boole 阅读全文