superkhadijah的博客

解法参考：https://www.youtube.com/watch?v=QnAqoK0GHToGiven a 01 matrix M, find the longest line of consecutive one in the matrix. The line could be horizontal, vertical, diagonal or anti-diagonal./** * 动态规划解法 * @param matrix * 01矩阵 * [[0.

二分查找（递归+while）、LIS（动态规划+二分）、lowerBound、upperBound/** *用while代替递归的二分查找 * @param array * @parram target * @return target的位置 */ public static int binarySearch(int[] array,int target){ int low = 0; int high = arr