[레벨 2] 최댓값과 최솟값

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

string solution(string s) {
    string answer = "";
    int len = s.size();
    int j;
    vector<int> num;
    for (int i = 0; i < len; ++i)
    {
        int j;
        if (s[i] == ' ')
            continue;
        if (s[i] == '-')
        {
            string k = "";
            k += '-';
            j = ++i;
            while (s[j] != ' ' && j != len)
            {
                k += s[j];
                ++j;
            }
            num.push_back(stoi(k));
            i = j;
        }
        else
        {
            string k = "";
            j = i;
            while (s[j] != ' ' && j != len)
            {
                k += s[j];
                ++j;
            }
            num.push_back(stoi(k));
            i = j;
        }
    }
    sort(num.begin(), num.end());
    int numLen = num.size();
    answer += to_string(num[0]);
    answer += ' ';
    answer += to_string(num[numLen - 1]);
    return answer;
}