[2018 윈터코딩] 방문길이

https://www.welcomekakao.com/learn/courses/30/lessons/49994

코딩테스트 연습 - 방문 길이 | 프로그래머스

오버라이딩을 통해 생각보다 간단히 풀었다

#include <string>
#include <vector>
#include <algorithm>
#include<iostream>
#include<map>
using namespace std;
pair<int, int> operator+(pair<int, int> &a, pair<int, int> &b) {
    int tmp = a.first + b.first;
    int tmp1 = a.second+ b.second;
    return { tmp, tmp1 };
}
bool operator==(pair<pair<int, int>, pair<int, int>>&a, pair<pair<int, int>, pair<int, int>> &b) {
    if (a.first.first == b.first.first && a.first.second == b.first.second && a.second.first == b.second.first && a.second.second == b.second.second) {
        return true;
    }
    else return false;
}
vector<pair<pair<int, int>, pair<int, int>>> path;
bool same(pair<int, int> be, pair<int, int> now) {
    pair<pair<int, int>, pair<int, int>> pathnow;
    pathnow = { be,now };
    for (int i = 0; i < path.size(); i++) {
        if (pathnow == path[i]) {
            return true;
        }
    }
     return false;
}
int solution(string dirs)
{
    int answer = 7;
    int cnt = 0;
    map<char, pair<int,int>> di;
    
    di.insert({ 'U',{ 1,0 } });
    di.insert({ 'D',{ -1,0 } });
    di.insert({ 'R',{ 0,1 } });
    di.insert({ 'L',{ 0,-1 } });
    pair<int, int> before = { 5,5 };
    pair<int, int> now;
    for (int i = 0; i < dirs.size(); i++) {
        char c = dirs[i];
        now = before + di[c];
 
        if (now.first >= 0 && now.first < 11 && now.second >= 0 && now.second < 11 && same(before, now) == false) {
            cnt++;
            path.push_back({ before,now });
            path.push_back({ now,before });
            before = now;
        }
        else if(now.first >= 0 && now.first < 11 && now.second >= 0 && now.second < 11 && same(before, now) == true)
            before = now;
 
    }
    return cnt;
}