[프로그래머스] 연속된 부분 수열의 합 java 풀이(LEVEL2)

https://school.programmers.co.kr/learn/courses/30/lessons/178870

프로그래머스

나의풀이

class Solution {
    public int[] solution(int[] sequence, int k) {
        int[] answer = new int[2];
        int[] sum= new int[sequence.length+1];
        sum[0]=0;
        
        for(int i=0; i<sequence.length; i++){
            sum[i+1]=sum[i]+sequence[i];
        }
        
        int start=0, end=0;
        int minVal =Integer.MAX_VALUE;
        while(start <= end){
            if(end == sum.length){
                break;
            }
            
            int partSum = sum[end]- sum[start];
            if(partSum == k){//같아도 안되고 커야함. 
                if(minVal > end-start){
                    answer[0] = start;
                    answer[1] = end-1;
                    minVal=end-start;
                }
                start++;
            }else if(partSum <k){
                end++;
            }else{
                start++;
            }
        }    
        return answer;
    }
}