Minimum value ruler method for the length of continuous subsequences whose sum is not less than s

public class  Continuous and not less than S The shortest subsequence of  {
	static int S = 15;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
      int[] arr = {5, 1, 3, 5, 10, 7, 4, 9, 2, 8};
      
		int sum = 0;
		int begin = 0;
		int end =0;
		int left = 0;
		int right = -1;
		int min = arr.length-1;
		while(true) {
			while(right<arr.length-1&&sum<S) {// Pay attention to the boundary problem , Here you can prevent the array from crossing the bounds 
				sum += arr[++right];// Move the right endpoint , until sum Greater than or equal to S
			}
			if(sum<S) break;//while Circulation outlet 
			end =right;
			min = Min(min,end - begin +1);// Find a relatively small interval length that meets the conditions ,
			sum -= arr[left++];// Through the outer layer while Cycle left endpoint 
			begin = left;
		}

		System.out.println(min);
      
	}
	
	public static int Min(int a,int b) {
		if(a>b) {
			return b;
		}
		else return a;
	}
	
}