关于一道二维数组算法面试题

题目：

 

方法1：

var arr = [[1,7,12,32],[5,9,18,38],[9,13,19,41],[17,20,32,50]]
var target = 39

var result = findCode(target,arr)
log.info('wwwwwwwwww',result)
			
function findCode(target,arr){
	let x = arr.length
	let y = arr[0].length
	let i = 0,j = y - 1 
	while(i < x && j >= 0){
	    if(arr[i][j] == target)return true
	    else if(arr[i][j]>target)j-=1
	    else if(arr[i][j]<target)i+=1
}
	     return false
	        }

方法2：

			function flatCode(target, arr) {
				let arr1 = arr.flat();
				let b = arr1.find((item) => item == target)
				if (b > -1) {
					return true
				} else {
					return false
				}

			}
			var result2 = flatCode(target, arr)
			log.info('result2', result2)

大佬轻点喷