Merge branch 'main' into 10-yuyu0830

InSange/DFS/2668.cpp

@@ -0,0 +1,60 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N, num;
+vector<bool> visited;
+vector<int> v;
+vector<int> answer;
+
+void DFS(int cur, int start)
+{
+	if (visited[cur] == true)
+	{
+		if (start == cur) answer.push_back(start);
+		return;
+	}
+
+	visited[cur] = true;
+	DFS(v[cur], start);
+	visited[cur] = false;
+}
+
+void Solve()
+{
+	cin >> N;
+
+	N += 1;
+	visited.assign(N, false);
+	v.assign(N, 0);
+
+	for (int i = 1; i < N; i++)
+	{
+		cin >> v[i];
+	}
+
+	for (int i = 1; i < N; i++)
+	{
+		DFS(i, i);
+	}
+
+	int asize = answer.size();
+	cout << asize << "\n";
+
+	for (int i = 0; i < asize; i++)
+	{
+		cout << answer[i] << "\n";
+	}
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}

InSange/README.md

@@ -7,6 +7,10 @@
 | 3차시 | 2024.03.19 |  플로이드 워셜  | [앱](https://www.acmicpc.net/problem/7579)  | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/9) |
 | 4차시 | 2024.03.25 |  다익스트라  | [파티](https://www.acmicpc.net/problem/1238)  | [#4](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/15)|
 | 5차시 | 2024.03.27 |  DP  | [RGB거리2](https://www.acmicpc.net/problem/17404)  | [#5](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/19)]
-| 6차시 | 2024.04.01 |  최소신장트리  | [행성 터널](https://www.acmicpc.net/problem/2887)  | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/19)]
-=======
+| 6차시 | 2024.04.01 |  최소신장트리  | [행성 터널](https://www.acmicpc.net/problem/2887)  | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/24)]
+| 7차시 | 2024.04.04 |  스택  | [문자열 폭발](https://www.acmicpc.net/problem/9935)  | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
+| 8차시 | 2024.04.09 |  투 포인터  | [두 용액](https://www.acmicpc.net/problem/2470)  | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/32)]
+| 9차시 | 2024.04.12 |  힙  | [Top K Frequent Words](https://leetcode.com/submissions/detail/1180988760/)  | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
+| 10차시 | 2024.05.02 |  스택  | [오아시스 재결합](https://www.acmicpc.net/problem/3015)  | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/40)]
+| 11차시 | 2024.05.02 |  DFS  | [숫자고르기](https://www.acmicpc.net/problem/2668)  | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/41)]
 ---

InSange/스택/3015.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <vector>
+#include <stack>
+
+using namespace std;
+
+long long N, n, a, b, answer;
+vector<int> line;
+stack<pair<int, int>> st;
+
+// a1 보다 b가 크면 종료
+// a1 보다 b가 작다면 다음 b는 
+void Solve()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> n;
+		line.push_back(n);
+	}
+
+	for (auto num : line)
+	{
+		int cnt = 1;
+
+		while (!st.empty())
+		{
+			int cur = st.top().first;
+			int cur_cnt = st.top().second;
+			if (cur < num)
+			{
+				answer+= cur_cnt;
+			}
+			else if (cur == num)
+			{
+				answer += cur_cnt;
+				cnt += cur_cnt;
+			}
+			else //if(st.top().first > num)
+			{
+				answer++;
+				break;
+			}
+			st.pop();
+		}
+		//cout << num << ", " << answer << "\n";
+		st.push({num, cnt});
+	}
+
+	cout << answer;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}

InSange/스택/9935.cpp

@@ -0,0 +1,54 @@
+#include <iostream>
+
+using namespace std;
+
+string s, boom;
+int blen;
+
+void Solve()
+{
+	cin >> s >> boom;
+
+	blen = boom.length();
+
+	string st = "";
+	for (char c : s)
+	{
+		st.push_back(c);
+
+		if (c == boom[blen-1] && st.size() >= blen)
+		{
+			bool flag = true;
+
+			for (int i = 0; i < blen; i++)
+			{
+				if (boom[i] != st[st.length() - blen + i])
+				{
+					flag = false;
+					break;
+				}
+			}
+
+			if (flag)
+			{
+				for (int i = 0; i < blen; i++)
+				{
+					st.pop_back();
+				}
+			}
+		}
+	}
+
+	if (st == "") cout << "FRULA";
+	else cout << st;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}

InSange/투포인터/2470.cpp

@@ -0,0 +1,96 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+const int MAX_VAL = 1999999999;
+
+int N, num, minVal, aanswer, banswer;
+vector<int> acid;	// »ê¼º
+vector<int> basic;	// ¿°±â¼º
+
+bool cmp(int a, int b)
+{
+	return a > b;
+}
+
+void Input()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> num;
+		(num > 0) ? acid.push_back(num) : basic.push_back(num);
+	}
+
+	sort(acid.begin(), acid.end());
+	sort(basic.begin(), basic.end(), cmp);
+
+	minVal = MAX_VAL;
+}
+
+void Solve()
+{
+	int a_index = 0;
+	int b_index = 0;
+	while (a_index < acid.size() && b_index < basic.size())
+	{
+		int anum, bnum;
+		anum = acid[a_index];
+		bnum = basic[b_index];
+
+		if (abs(anum + bnum) < minVal)
+		{
+			aanswer = anum;
+			banswer = bnum;
+			minVal = abs(anum + bnum);
+		}
+
+		(abs(anum) > abs(bnum)) ? b_index++ : a_index++;
+	}
+
+	int sum;
+	if (acid.size() > 1)
+	{
+		sum = abs(acid[0] + acid[1]);
+		if (sum < minVal)
+		{
+			aanswer = acid[1];
+			banswer = acid[0];
+		}
+	}
+	if (basic.size() > 1)
+	{
+		sum = abs(basic[0] + basic[1]);
+		if (sum < minVal)
+		{
+			aanswer = basic[0];
+			banswer = basic[1];
+		}
+	}
+	if (acid.empty())
+	{
+		aanswer = basic[0];
+		banswer = basic[1];
+	}
+	if (basic.empty())
+	{
+		aanswer = acid[1];
+		banswer = acid[0];
+	}
+
+	cout << banswer << " " << aanswer;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Input();
+	Solve();
+
+	return 0;
+}

InSange/힙/Top K Frequent Words.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+#include <unordered_map>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    struct compare {
+        bool operator()(pair<int, string>& a, pair<int, string>& b)
+        {
+            if (a.first == b.first) return a.second > b.second;
+            return a.first < b.first;
+        }
+    };
+
+    vector<string> topKFrequent(vector<string>& words, int k) {
+        unordered_map<string, int> um;
+        priority_queue<pair<int, string>, vector<pair<int, string>>, compare> pq;
+        vector<string> ans;
+
+        for (auto s : words) um[s]++;
+        for (pair<string, int> v : um) pq.push({ v.second, v.first });
+
+        while (k--)
+        {
+            ans.push_back(pq.top().second);
+            pq.pop();
+        }
+
+        return ans;
+    }
+};

dhlee777/README.md

@@ -6,6 +6,6 @@
 | 2차시 | 2024.03.18 |   DP  | [쉬운계단수](https://www.acmicpc.net/problem/10844) | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/8)|
 | 3차시 | 2024.03.23 |   union-find  | [집합의 표현](https://www.acmicpc.net/problem/1717) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/14)|
 | 4차시 | 2024.03.25 |   BFS  | [바이러스](https://www.acmicpc.net/problem/2606) | [#17](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/17)|
-| 5차시 | 2024.03.30 |   MST  | [최소스패닝트리](https://www.acmicpc.net/problem/1197) | [#21](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/21)|
+| 5차시 | 2024.03.30 |  mst  | [최소스패닝트리](https://www.acmicpc.net/problem/1197) | [#21](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/21)|
 | 6차시 | 2024.04.04 |  backtracking  | [스타트와링크](https://www.acmicpc.net/problem/14889) | [#29](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/29)|
----
+| 7차시 | 2024.04.08 |  backtracking  | [n과m(5)](https://www.acmicpc.net/problem/15654) | [#31](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/31)|

dhlee777/backtracking/n과m(5).cpp

@@ -0,0 +1,36 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+using namespace std;
+int num_size, picked_size;
+int num[8];   //입력받은 숫자들을 저장하는 배열
+bool visited[8];  //방문했는지 확인하기위한 배열
+vector<int>v;  //숫자들을 순서대로 넣기위한 벡터
+void dfs(int cnt, int vt) {  //cnt는 방문숫자 카운팅,vt는 현재 숫자를 나타낸다.
+	if (cnt == picked_size) {  // 방문한 수와 입력받은 골라야하는 개수가 같은경우,dfs(3,2)일 경우 셋째자리수가 num[2]일때의 수열들을 리턴해주는 함수 
+
+		for (auto k : v) {
+			cout << k << " ";    //벡터에 있는 수열을 출력
+		}
+		cout << "\n";
+	}
+	for (int j = 0; j < num_size; j++) {  //조합이 아니라 수열이므로 인덱스0부터 탐색시작
+		if (!visited[j]) {          //num[j]를 방문하지 않았다면
+			visited[j] = true;      //방문 표시를 하여주고
+			v.push_back(num[j]);  //벡터에 그 수를 넣어준다.
+			dfs(cnt + 1, j);  //카운트를 올려주고 j로이동해 다시 탐색진행
+			v.pop_back();     //탐색이 끝났다면 벡터끝에서 수 하나를 빼준다.
+			visited[j] = false;  //다른 경우를위해 j를 방문안했다고 바꿔준다.
+		}
+	}
+}
+int main(void) {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	cin >> num_size >> picked_size;
+	for (int i = 0; i < num_size; i++) {
+		cin >> num[i];
+	}
+	sort(num, num + num_size);  //입력받은 수는 뒤죽박죽이므로 오름차순 정렬을 시켜준다.
+	dfs(0, 0);
+}