codility test 4

最新推荐文章于 2021-03-18 21:26:32 发布

bluegrass986

最新推荐文章于 2021-03-18 21:26:32 发布

阅读量731

点赞数

CC 4.0 BY-SA版权

分类专栏： codility test

本文链接：https://blog.youkuaiyun.com/bluegrass986/article/details/38921395

codility test 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种高效算法，用于查找给定整数数组中缺失的最小正整数。该算法利用 BitSet 数据结构实现，确保了 O(N) 的时间复杂度及空间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.lesson2;

import java.util.BitSet;

/**
 * 
 * Write a function: class Solution { public int solution(int[] A); } that,
 * given a non-empty zero-indexed array A of N integers, returns the minimal
 * positive integer that does not occur in A. For example, given: A[0] = 1 A[1]
 * = 3 A[2] = 6 A[3] = 4 A[4] = 1 A[5] = 2 the function should return 5. Assume
 * that: N is an integer within the range [1..100,000]; each element of array A
 * is an integer within the range [−2,147,483,648..2,147,483,647]. Complexity:
 * expected worst-case time complexity is O(N); expected worst-case space
 * complexity is O(N), beyond input storage (not counting the storage required
 * for input arguments). Elements of input arrays can be modified.
 * 
 */
public class MissingInteger {
	public int solution(int[] A) {
		  BitSet bs = new BitSet();
	        for(int i = 0; i <A.length;i++){
	            if(A[i] > 0 && A[i] <= A.length){
	                bs.set(A[i]);
	            }
	        }
	        for(int i = 1; i <= A.length; i++){
	            if(!bs.get(i)){
	                return i;
	            }
	        }
	        return A.length+1;
	}
}