[Java 알고리즘] 8. DFS/BFS 모음 (+백트래킹)

DFS

https://cote.inflearn.com/contest/10/problem/08-01

OnlineJudge

https://and-some.tistory.com/647

[Ch.08 - DFS] 03. 합이 같은 부분집합

 

 

https://cote.inflearn.com/contest/10/problem/08-02

OnlineJudge

https://and-some.tistory.com/648

[Ch.08 - DFS] 04. 바둑이 승차

 

https://cote.inflearn.com/contest/10/problem/08-03

OnlineJudge

https://and-some.tistory.com/649

[Ch.08 - DFS] 05. 최대점수 구하기

 

 

https://cote.inflearn.com/contest/10/problem/08-05

OnlineJudge

https://and-some.tistory.com/651

[Ch.08 - DFS] 07. 동전교환 #

 

#순열 공식

	static int[] pm, ch, arr;
	// pm: 결과 배열, ch : 중복 체크 배열, arr : 값 배열

	public void DFS(int L) {
		// 3 2-> 3 6 9 -> 3 6, 3 9, 6 3, 6 9, 9 3, 9 6
		if (L == m) {
			// 한 개의 순열 완성
			for (int x : pm) {
				System.out.print(x + " ");
			}
			System.out.println();
		} else {
			for (int i = 0; i < n; i++) {
				if (ch[i] == 0) {
					// 중복체크 하면서 값 배열에서 가져오기
					ch[i] = 1;
					// 사용하기 전 체크리스트에 1로 변경
					pm[L] = arr[i];
					// 값 배열에서 가져와 결과 배열에 넣기
					DFS(L + 1);
					// 기준 값 다음 값 가져오기
					ch[i] = 0;
					// 사용 후 체크리스트 0으로 초기화
				}
			}
		}
	}

 

https://and-some.tistory.com/652

[Ch.08 - DFS] 08. 순열 구하기

 

 

https://cote.inflearn.com/contest/10/problem/08-07

OnlineJudge

https://and-some.tistory.com/653

[Ch.08 - DFS] 09. 조합의 경우수(메모이제이션)

 

 

https://cote.inflearn.com/contest/10/problem/08-08

OnlineJudge

https://and-some.tistory.com/654

[Ch.08 - DFS] 10. 수열 추측하기 #

 

 

---

 

 

BFS

 

https://cote.inflearn.com/contest/10/problem/07-08

 

OnlineJudge

https://and-some.tistory.com/644

[Ch.07 - BFS] 02. 송아지 찾기 (+BFS : 상대트리탐색)

 

[Ch.07 - BFS] 02. 송아지 찾기 (+BFS : 상대트리탐색)

 

https://cote.inflearn.com/contest/10/problem/08-11

OnlineJudge

https://and-some.tistory.com/646

[Ch.08 - BFS] 03. 미로의 최단거리 통로

 

https://cote.inflearn.com/contest/10/problem/08-12

OnlineJudge

https://and-some.tistory.com/656

[Ch.08 - BFS] 04. 토마토

 

 

---

DFS/BFS

 

 

https://cote.inflearn.com/contest/10/problem/08-13

OnlineJudge

https://and-some.tistory.com/657

[Ch.08 - DFS / BFS] 13. 섬나라 아일랜드 #

---

 

https://leetcode.com/problems/number-of-islands/

Number of Islands - LeetCode

https://and-some.tistory.com/909

[LeetCode- Ch7. DFS & BFS] 1. 섬의 수

 

 

https://leetcode.com/problems/max-area-of-island/submissions/

Max Area of Island - LeetCode

https://and-some.tistory.com/911

[LeetCode- Ch7. DFS & BFS] 3. 섬의 최대 면적

 

https://leetcode.com/problems/word-ladder/

Word Ladder - LeetCode

https://and-some.tistory.com/912

[LeetCode- Ch7. DFS & BFS] 4. 단어 사다리 #

 

 

https://leetcode.com/problems/word-search/

Word Search - LeetCode

https://and-some.tistory.com/913

[LeetCode- Ch7. DFS & BFS] 5. 단어 검색 #

 

 

https://leetcode.com/problems/remove-invalid-parentheses/

Remove Invalid Parentheses - LeetCode

https://and-some.tistory.com/914

[LeetCode- Ch7. DFS & BFS] 6. 유효하지 않은 괄호 제거

 

https://www.lintcode.com/problem/787/

LintCode 炼码

https://and-some.tistory.com/915

[LeetCode- Ch7. DFS & BFS] 7. 구슬 미로

 

---

 

https://leetcode.com/problems/path-with-maximum-gold/submissions/

Path with Maximum Gold - LeetCode

https://and-some.tistory.com/930

 

[LeetCode- Part. 1] 7. 금광 찾기 #

 

 

https://and-some.tistory.com/936

[LeetCode- Part. 2] 5. 음식을 구하기위한 최단 경로 (+BFS)

 

https://leetcode.com/problems/number-of-provinces/

Number of Provinces - LeetCode

https://and-some.tistory.com/946

[LeetCode- Part. 3] 5. Province의 수 (+DFS)

 

 

https://leetcode.com/problems/shortest-path-in-binary-matrix/

Shortest Path in Binary Matrix - LeetCode

https://and-some.tistory.com/952

[LeetCode- Part. 4] 5. 이진 매트릭스 최단경로 (+BFS)

---

 

백트래킹

 

https://leetcode.com/problems/generate-parentheses/

Generate Parentheses - LeetCode

https://and-some.tistory.com/920

[LeetCode- Ch9. 백트래킹] 1. 생성된 괄호 #

 

 

https://leetcode.com/problems/permutations/

Permutations - LeetCode

https://and-some.tistory.com/921?category=1011285 

[LeetCode- Ch9. 백트래킹] 2. 순열 #

 

 

https://leetcode.com/problems/subsets/submissions/

Subsets - LeetCode

https://and-some.tistory.com/922

[LeetCode- Ch9. 백트래킹] 3. 부분집합

 

 

https://leetcode.com/problems/letter-combinations-of-a-phone-number/submissions/

Letter Combinations of a Phone Number - LeetCode

https://and-some.tistory.com/923

[LeetCode- Ch9. 백트래킹] 4. 핸드폰 숫자의 문자 조합