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

Update code style for Python

Browse Source
This commit is contained in:
krahets
2023-03-03 03:07:22 +08:00
parent 7e9e6b000c
commit 7c501140f0
45 changed files with 274 additions and 266 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
codes/python/chapter_computational_complexity/space_complexity.py
View File

@ -6,15 +6,15 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
""" 函数 """
def function():
""" 函数 """
# do something
return 0
""" 常数阶 """
def constant(n):
""" 常数阶 """
# 常量、变量、对象占用 O(1) 空间
a = 0
nums = [0] * 10000
@ -26,8 +26,8 @@ def constant(n):
for _ in range(n):
function()
""" 线性阶 """
def linear(n):
""" 线性阶 """
# 长度为 n 的列表占用 O(n) 空间
nums = [0] * n
# 长度为 n 的哈希表占用 O(n) 空间
@ -35,26 +35,26 @@ def linear(n):
for i in range(n):
mapp[i] = str(i)
""" 线性阶（递归实现） """
def linear_recur(n):
""" 线性阶（递归实现） """
print("递归 n =", n)
if n == 1: return
linear_recur(n - 1)
""" 平方阶 """
def quadratic(n):
""" 平方阶 """
# 二维列表占用 O(n^2) 空间
num_matrix = [[0] * n for _ in range(n)]
""" 平方阶（递归实现） """
def quadratic_recur(n):
""" 平方阶（递归实现） """
if n <= 0: return 0
# 数组 nums 长度为 n, n-1, ..., 2, 1
nums = [0] * n
return quadratic_recur(n - 1)
""" 指数阶（建立满二叉树） """
def build_tree(n):
""" 指数阶（建立满二叉树） """
if n == 0: return None
root = TreeNode(0)
root.left = build_tree(n - 1)