SubArray sum

In an array of non-negative intergers find a sequence of integers which sum up to the given number. I.e. [1, 2, 3], find 5 -> return [2, 3]

public int sums(int[] seq, int sum) {
    int csum = 0, right = 0, left = 0;
    boolean notfound = true;

    while(right < seq.length && notfound) {
      for(int i = right; i < seq.length; i++) {   
        csum +=seq[i];
        if(csum == sum) {left = i; notfound=false; break;}
        if(csum > sum) { csum=0; break;}
      }
      csum=0;
      right++;
      
    }

    if(notfound) {right=1; left = -1; }
    int[] res = Arrays.copyOfRange(seq,right-1, left+1);
    
    System.out.println(Arrays.toString(res));
    System.out.println(right-1);
    System.out.println(left);
    System.out.println(notfound);


    return 0;
  }