Merge pull request #404 from boostcamp-ai-tech-4/sally-220122

[샐리] 2022.01.22

Author: CoodingPenguin

sally/programmers/week6/빛의 경로 사이클.cpp

@@ -0,0 +1,46 @@
+#include <string>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+vector<int> solution(vector<string> grid) {
+    vector<int> answer;
+    int dir[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
+    
+    // init
+    int N = grid.size();
+    int M = grid[0].size();
+    
+    int visit[501][501][4] = {false,};
+    int arr[501][501] = {0,};
+    for(int i = 0; i < N; i++)
+        for(int j = 0; j < M; j++){
+            if(grid[i][j] == 'S') arr[i][j] = 0;
+            else if(grid[i][j] == 'L') arr[i][j] = -1;
+            else if(grid[i][j] == 'R') arr[i][j] = 1;
+        }
+    
+    // check all cases
+    for(int i = 0; i < N; i++)
+        for(int j = 0; j < M; j++)
+            for(int k = 0; k < 4; k++){ // light direction
+                int cur_dir = k, cur_x = i, cur_y = j;
+                int cnt = 0;
+                if(visit[cur_x][cur_y][cur_dir]) continue;
+                while(1){
+                    if(visit[cur_x][cur_y][cur_dir]) break;
+                    visit[cur_x][cur_y][cur_dir] = true;
+                    cnt++;
+                    
+                    cur_x = (cur_x + dir[cur_dir][0] + N) % N;
+                    cur_y = (cur_y + dir[cur_dir][1] + M) % M; 
+                    
+                    cur_dir = (cur_dir + arr[cur_x][cur_y] + 4) % 4;
+                }
+                answer.push_back(cnt);
+            }
+    
+    sort(answer.begin(), answer.end());
+    return answer;
+}

sally/programmers/week6/전화번호 목록.cpp

@@ -0,0 +1,20 @@
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <iostream>
+using namespace std;
+
+bool solution(vector<string> phone_book) {
+    bool answer = true;
+    
+    int size_ = phone_book.size();
+    sort(phone_book.begin(), phone_book.end());
+    
+    for (int i = 0; i < size_-1; i++) {
+        int s = phone_book[i].size();
+        if (phone_book[i].compare(phone_book[i+1].substr(0, s)) == 0) 
+            return false;
+    }
+
+    return answer;
+}

sally/programmers/week6/프린터.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <queue>
+#include <math.h>
+#include <algorithm>
+
+using namespace std;
+
+int solution(vector<int> priorities, int location) {
+    int answer = 0;
+    int remain[10] = { 0, };
+    pair<int, bool> target;
+    queue<pair<int, bool>> q;
+
+    for (int i = 0; i < priorities.size(); i++) {
+        remain[priorities[i]]++;
+
+        if (i == location) q.push({ priorities[i], true });
+        else q.push({ priorities[i], false });
+    }
+
+    while (1) {
+        target = q.front();
+        q.pop();
+
+        bool pushed = false;
+        for (int i = 9; i > target.first; i--) { // 더 큰 우선순위가 있는지 확인
+            if (remain[i] > 0) {
+                q.push(target);
+                pushed = true;
+                break;
+            }
+        }
+        if (pushed == false) {
+            answer++;
+            remain[target.first]--;
+            if (target.second == true) return answer;
+        }
+    }
+
+    return answer;
+}