1-g0rnn

g0rnn/DFS,BFS/4-g0rnn3.cpp

@@ -0,0 +1,19 @@
+#include <string>
+#include <vector>
+
+using namespace std;
+
+int dfs(vector<int>& numbers, int target, int i, int value) {
+    if(numbers.size() <= i) {
+        return (target == value) ? 1 : 0;
+    }
+
+    return dfs(numbers, target, i+1, value + numbers[i]) 
+        + dfs(numbers, target, i+1, value - numbers[i]);
+}
+
+int solution(vector<int> numbers, int target) {
+    return dfs(numbers, target, 0, 0);
+}
+
+

g0rnn/스택,큐/4-g0rnn.cpp

@@ -0,0 +1,19 @@
+#include <vector>
+#include <iostream>
+
+using namespace std;
+
+vector<int> solution(vector<int> arr) 
+{
+    vector<int> answer;
+
+    answer.push_back(arr[0]);
+
+    for(int i=1; i<arr.size(); i++) {
+        if(arr[i-1] != arr[i]) {
+            answer.push_back(arr[i]);
+        }
+    }
+
+    return answer;
+}

g0rnn/스택,큐/4-g0rnn2.cpp

@@ -0,0 +1,30 @@
+#include <string>
+#include <vector>
+#include <cmath>
+
+using namespace std;
+
+vector<int> solution(vector<int> progresses, vector<int> speeds) {
+    vector<int> answer;
+    vector<int> days;
+
+    for(int i=0; i<progresses.size(); i++) {
+        int day = ceil((100 - progresses[i]) / (double)speeds[i]);
+        days.push_back(day);
+    }
+
+    int cur_max = days[0];
+    int cnt = 1;
+
+    for(int i=1; i<days.size(); i++) {
+        if(cur_max >= days[i]) cnt++;
+        else {
+            answer.push_back(cnt);
+            cur_max = days[i];
+            cnt = 1;
+        }
+    }
+    answer.push_back(cnt);
+
+    return answer;
+}