Discuss / Java / 交作业,时间复杂度为o(n)

交作业,时间复杂度为o(n)

Topic source


static int findMissingNumber1(int start, int end, List<Integer> list) {

		Integer[] temp = new Integer[end-start+1];

		Iterator<Integer> it = list.iterator();

         int i=0;

		for (;it.hasNext();i++) {

			Integer vaule = it.next();

			temp[vaule-start]=1;

		}

		//System.out.println(Arrays.asList(temp));

		int result=-1;

		for(;i>=0;i--) {

			if(temp[i]==null) {

				result = start+i;

				break;

			}

		}

		return result;

	}




  • 1

Reply