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

Format the Java codes with the Reat Hat extension.

Browse Source
This commit is contained in:
krahets
2023-04-14 00:12:10 +08:00
parent 7273ee24e8
commit f8513455b5
39 changed files with 195 additions and 205 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
codes/java/chapter_computational_complexity/space_complexity.java
View File

@ -15,7 +15,7 @@ public class space_complexity {
// do something
return 0;
}
/* 常数阶 */
static void constant(int n) {
// 常量、变量、对象占用 O(1) 空间
@ -52,7 +52,8 @@ public class space_complexity {
/* 线性阶（递归实现） */
static void linearRecur(int n) {
System.out.println("递归 n = " + n);
if (n == 1) return;
if (n == 1)
return;
linearRecur(n - 1);
}
@ -73,7 +74,8 @@ public class space_complexity {
/* 平方阶（递归实现） */
static int quadraticRecur(int n) {
if (n <= 0) return 0;
if (n <= 0)
return 0;
// 数组 nums 长度为 n, n-1, ..., 2, 1
int[] nums = new int[n];
System.out.println("递归 n = " + n + " 中的 nums 长度 = " + nums.length);
@ -82,7 +84,8 @@ public class space_complexity {
/* 指数阶（建立满二叉树） */
static TreeNode buildTree(int n) {
if (n == 0) return null;
if (n == 0)
return null;
TreeNode root = new TreeNode(0);
root.left = buildTree(n - 1);
root.right = buildTree(n - 1);