Integerarray题目汇总

1. 和为k的的子数组

public static List zeroSubArray(int []nums,int k){
		HashMapmap=new HashMap();
		Listlist=new ArrayList();
//		List>res=new ArrayList<>();
		int sum=0;
		map.put(0, 0);
		for (int i = 0; i ();
				
			}else{
				map.put(sum, i+1);
			}
		}
		return list;

2. First Missing Positive 类似基数排序

public int firstMissingPositive(int[] A) {  
    if(A==null || A.length==0)  
    {  
        return 1;  
    }  
    for(int i=0;i0 && A[A[i]-1]!=A[i])  
        {  
            int temp = A[A[i]-1];  
            A[A[i]-1] = A[i];  
            A[i] = temp;  
            i--;  
        }  
    }  
    for(int i=0;i