문제(제일 작은 수 제거하기)
https://school.programmers.co.kr/learn/courses/30/lessons/12935
제출한 답안
#include <string>
#include <vector>
#include <iostream>
using namespace std;
vector<int> solution(vector<int> arr) {
vector<int> answer;
vector<int>::iterator minIter = arr.begin();
for (vector<int>::iterator iter = arr.begin() + 1; iter < arr.end(); iter++)
{
if (*minIter > *iter)
{
minIter = iter;
}
}
arr.erase(minIter);
if (arr.size() <= 0)
{
arr.push_back(-1);
}
answer = arr;
return answer;
}
문제(가운데 글자 가져오기)
https://school.programmers.co.kr/learn/courses/30/lessons/12903
제출한 답안
#include <string>
#include <vector>
using namespace std;
string solution(string s) {
string answer = "";
int middleIndex = s.length() / 2;
if (s.length() % 2 == 1)
{
answer = s[middleIndex];
}
else
{
answer = s.substr(middleIndex - 1, 2);
}
return answer;
}
문제(수박수박수박수박수박수?)
https://school.programmers.co.kr/learn/courses/30/lessons/12922
제출한 답안
#include <string>
#include <vector>
using namespace std;
string solution(int n) {
string answer = "";
string su = "수";
string park = "박";
for (int i = 0; i < n; i++)
{
if (i % 2 == 0)
{
answer += su;
}
else
{
answer += park;
}
}
return answer;
}
깃허브 링크(어려워서 시간이 많이 걸림)
https://github.com/sammy3831/HW04