算法的一些总结,注解,图文说明,代码演示. Contribute to PopCandier/algorithm-note development by creating an account on GitHub.
length;//总列数 int currentRow = 0;//起始遍历位置是右上角,行号为0 int currentCol = colLength - 1;//起始遍历位置是右上角,列号为最大值 while (currentRow <rowLength && currentCol >= 0) {//防止超出边界 if (array[currentRow][currentCol] == target) { return true; } else ...