java程式設計無向圖結構的儲存及DFS操作程式碼詳解
圖的概念 圖是演算法中是樹的拓展，樹是從上向下的資料結構，結點都有一個父結點（根結點除外），從上向下排列。而圖沒有了父子結點的概念，圖中的結點都是平等關係，結果更加複雜。 無向圖 & […]
dfs
1/6ページ
Combination Sum
標籤： C 演算法 LeetCode 陣列 DFS 每日演算法——leetcode系列 問題 Combination Sum Difficulty: Medium Given a set of candidate numbers (C) and a target number (T), find a […]
Combination Sum II
標籤（空格分隔）： C 演算法 LeetCode 陣列 中等 DFS 每日演算法——leetcode系列 問題 Combination Sum II Difficulty: Medium Given a set of candidate numbers (C) and a target number […]
- 2018.06.18
- backtracking, c, dfs, online-judge, 演算法,
[解題][zerojudge] a229: 括號匹配問題
原題目在zerojudge,若對於backtracking技術不熟可看演演算法筆記-backtracking Problem 請寫一個程式把所有合法括號匹配方式列出來! Ex: 以下是合法的匹配方式 (()) Ex. 不合法匹配 (()))( 字串 ( 左括弧 : 1 >= 右括弧 : 0 字 […]
[LintCode] Route Between Two Nodes in Graph [DFS/BFS]
Problem Given a directed graph, design an algorithm to find out whether there is a route between two nodes. Example Given graph: A----->B----->C […]
- 2018.06.17
- backtracking, dfs, java, recursion, 陣列,
[LintCode/LeetCode] Combinations
Problem Given two integers n and k, return all possible combinations of k numbers out of 1 … n. Example For example,If n = 4 and k = 2, a soluti […]
- 2018.06.17
- backtracking, dfs, java, recursion, 陣列,
[LintCode/LeetCode] Combination Sum I & II
Combination Sum I Problem Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers […]
[LintCode] Topological Sorting [BFS & DFS]
Problem Given an directed graph, a topological order of the graph nodes is defined as follow: For each directed edge A -> B Challenge Can you do it […]
- 2018.06.17
- binary-tree, dfs, dynamic-programming, java,
[LintCode/LeetCode] House Robber III
Problem The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Beside […]
[LintCode/LeetCode] N-Queens I & II [N皇后]
N-Queens Problem The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integ […]