暴力破解
二维数组中的查找
http://www.nowcoder.com/questionTerminal/abc3fe2ce8e146608e868a70efebf62e
public class Solution { public boolean Find(int target, int [][] array) { int cons = array[0].length; int lins = array.length; for(int i=0;i<lins;i++){ for(int j=0;j<cons;j++){ if(target==array[i][j])return true; } } return false; } }