zoukankan      html  css  js  c++  java
  • 刷题_剑指_二维数组中的查找

    import java.util.*;
    /**
     * 二维数组中的查找
     * 题目描述:一个二维数组,每一行从左到右递增,
     * 每一列从上到下递增,输入一个二维数组和一个整数,
     * 判断数组中是否含有该整数
     * @author zz
     *
     */
    public class Main {
    	public static boolean find(int[][] array, int k) {
    		int i = array.length - 1;
    		int j = 0;
    		while(i >= 0 && j < array[0].length) {
    			 if(array[i][j] == k) {
    					System.out.println("数组中存在该整数");
    					System.out.println("----i = " + i + "----j = " + j);
    					return true;
    			}
    			if(array[i][j] > k) {
    				i--;
    			} else {
    				j++;
    			}
    		}
    		System.out.println("未找到整数" + k);
    		return false;		
    	}
    	
    	public static void main(String[] args) {
    		int[][] a = new int[4][4];
    		a[0][0] = 1;
    		a[0][1] = 2;
    		a[0][2] = 8;
    		a[0][3] = 9;
    		a[1][0] = 2;
    		a[1][1] = 4;
    		a[1][2] = 9;
    		a[1][3] = 12;
    		a[2][0] = 4;
    		a[2][1] = 7;
    		a[2][2] = 10;
    		a[2][3] = 13; 
    		a[3][0] = 6;
    		a[3][1] = 8;
    		a[3][2] = 11;
    		a[3][3] = 15;
    		find(a,14);
    	}
    }
    

      

  • 相关阅读:
    2014-04-23 总结
    14-5-13
    PHP
    14-5-8
    ajax
    14-5-6
    14-5-5
    PHP初解
    14-4-30
    14-4-29
  • 原文地址:https://www.cnblogs.com/zzsaf/p/6932160.html
Copyright © 2011-2022 走看看