首页 > 代码库 > CC150 9.6
CC150 9.6
9.6 Given a matrix in which each row and each column is sorted, write a method to find an element in it.
void search(int[][]a, int t) { int m = a.length; int n = a[0].length; // Start from right-up point. // if rightUp == t, found // if rightUp > t, all column are > t // if rightUp < t, all row are < t // finally we will reach some node, or cannot find it. int row = 0; int col = n - 1; while (row < m && col >= 0) { if (a[row][col] == t) { // Found !:) return; } else if (a[row][col] > t) { col --; } else { row ++; } } // Not found :( }
CC150 9.6
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。