C++ (코딩테스트) - 우박수열 정적분(프로그래머스)

문제

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

프로그래머스

 

내가 쓴 코드

 

#include <string>
#include <vector>

using namespace std;

vector<double> solution(int k, vector<vector<int>> ranges) {
    vector<double> answer(0);
    vector<float> ubak_con(0);

    while (true)
    {
        if (k <= 1) break;
        int temp = k;
        k = (k % 2 == 0) ? k /= 2 : k = 3 * k + 1;
        ubak_con.push_back((float)(temp + k) / 2);
    }

    for (int i = 0; i < ranges.size(); i++)
    {
        double sum = 0; 
        int start = ranges[i][0];
        int end = ubak_con.size() + ranges[i][1];
        for (int j = start; j < end; j++)
        {
            sum += (double)ubak_con[j];
        }

        if (start > end) { sum = -1; }
        answer.push_back(sum);
    }
    return answer;
}

 

 

(signal: segmentation fault (core dumped)) 에러나서 바꿈

	for (int j = ranges[i][0]; j < ubak_con.size() + ranges[i][1]; j++)
        {
            sum += (double)ubak_con[j];
        }

//(signal: segmentation fault (core dumped)) 에러나서 아래로 바꿈

	int start = ranges[i][0];
        int end = ubak_con.size() + ranges[i][1];
        for (int j = start; j < end; j++)
        {
            sum += (double)ubak_con[j];
        }