algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Rename the naming of the coding files

Browse Source 
in backtracking algorithm.
Add the typedef to docs.
This commit is contained in:
krahets
2023-04-22 01:38:53 +08:00
parent 9eeefff447
commit bad759b4f8
17 changed files with 98 additions and 98 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/java/chapter_backtracking/preorder_find_nodes.java → codes/java/chapter_backtracking/preorder_traversal_i_compact.java
View File

@@ -1,5 +1,5 @@
/**
* File: preorder_find_nodes.java
* File: preorder_traversal_i_compact.java
* Created Time: 2023-04-16
* Author: Krahets (krahets@163.com)
*/
@@ -9,10 +9,10 @@ package chapter_backtracking;
import include.*;
import java.util.*;
public class preorder_find_nodes {
public class preorder_traversal_i_compact {
static List<TreeNode> res;
/* 前序遍历 */
/* 前序遍历：例题一 */
static void preOrder(TreeNode root) {
if (root == null) {
return;

6
codes/java/chapter_backtracking/preorder_find_paths.java → codes/java/chapter_backtracking/preorder_traversal_ii_compact.java
View File

@@ -1,5 +1,5 @@
/**
* File: preorder_find_paths.java
* File: preorder_traversal_ii_compact.java
* Created Time: 2023-04-16
* Author: Krahets (krahets@163.com)
*/
@@ -9,11 +9,11 @@ package chapter_backtracking;
import include.*;
import java.util.*;
public class preorder_find_paths {
public class preorder_traversal_ii_compact {
static List<TreeNode> path;
static List<List<TreeNode>> res;
/* 前序遍历 */
/* 前序遍历：例题二 */
static void preOrder(TreeNode root) {
if (root == null) {
return;

6
codes/java/chapter_backtracking/preorder_find_constrained_paths.java → codes/java/chapter_backtracking/preorder_traversal_iii_compact.java
View File

@@ -1,5 +1,5 @@
/**
* File: preorder_find_constrained_paths.java
* File: preorder_traversal_iii_compact.java
* Created Time: 2023-04-16
* Author: Krahets (krahets@163.com)
*/
@@ -9,11 +9,11 @@ package chapter_backtracking;
import include.*;
import java.util.*;
public class preorder_find_constrained_paths {
public class preorder_traversal_iii_compact {
static List<TreeNode> path;
static List<List<TreeNode>> res;
/* 前序遍历 */
/* 前序遍历：例题三 */
static void preOrder(TreeNode root) {
// 剪枝
if (root == null || root.val == 3) {

6
codes/java/chapter_backtracking/backtrack_find_constrained_paths.java → codes/java/chapter_backtracking/preorder_traversal_iii_template.java
View File

@@ -1,5 +1,5 @@
/**
* File: backtrack_find_constrained_paths.java
* File: preorder_traversal_iii_template.java
* Created Time: 2023-04-16
* Author: Krahets (krahets@163.com)
*/
@@ -9,7 +9,7 @@ package chapter_backtracking;
import include.*;
import java.util.*;
public class backtrack_find_constrained_paths {
public class preorder_traversal_iii_template {
/* 判断当前状态是否为解 */
static boolean isSolution(List<TreeNode> state) {
return !state.isEmpty() && state.get(state.size() - 1).val == 7;
@@ -35,7 +35,7 @@ public class backtrack_find_constrained_paths {
state.remove(state.size() - 1);
}
/* 回溯算法 */
/* 回溯算法：例题三 */
static void backtrack(List<TreeNode> state, List<TreeNode> choices, List<List<TreeNode>> res) {
// 检查是否为解
if (isSolution(state)) {