Java实现——查找数组中连续元素的和等于给定数的子数组

转自几个面试经典算法题Java解答（/sunniest/p/）题目二

//给出一个排序好的数组和一个数，求数组中连续元素的和等于所给数的子数组

public class SubArraySum {
	public void findSubArraySum(int[] array , int sum){
		if(array == null ||  == 0){
			("array is empty.");
			return;
		}
		for(int i = 0 ; i <  ; i++){
			int temp = 0;
			for(int j = i ; j <  ; j++){
				temp += array[j];
				if(temp < sum){					
					continue;
				}else if(temp == sum){
					for(int k = i ; k <= j ; k++){
						(array[k] + " ");
					}	
					();
					break;
				}else{
					break;
				}
			}
		}
	}

public void findSubArraySum2(int[] a , int n){ if(a == null ||  == 0){ return; } int start = 0 , end = 0; for(int i = 0 ; i <  ; i++){ int sum = a[i]; start = i; end = i; for(int k = i + 1 ; k <  && sum < n ; k++){ sum += a[k]; end = k; } if(sum == n){ for(int j = start ; j <=end ; j++){ (a[j] + " "); } return; } } ("No such sub array exists."); } 

public static void main(String[] args) {SubArraySum sa = new SubArraySum();int[] a = {1,2,3,4,5,6};(a, 6);}}