algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-12 18:10:42 +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

6
codes/python/chapter_computational_complexity/leetcode_two_sum.py
View File

@ -6,10 +6,10 @@ 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 two_sum_brute_force(nums: List[int], target: int) -> List[int]:
""" 方法一：暴力枚举 """
# 两层循环，时间复杂度 O(n^2)
for i in range(len(nums) - 1):
for j in range(i + 1, len(nums)):
@ -17,8 +17,8 @@ def two_sum_brute_force(nums: List[int], target: int) -> List[int]:
return i, j
return []
""" 方法二：辅助哈希表 """
def two_sum_hash_table(nums: List[int], target: int) -> List[int]:
""" 方法二：辅助哈希表 """
# 辅助哈希表，空间复杂度 O(n)
dic = {}
# 单层循环，时间复杂度 O(n)

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)

24
codes/python/chapter_computational_complexity/time_complexity.py
View File

@ -6,33 +6,33 @@ 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 constant(n):
""" 常数阶 """
count = 0
size = 100000
for _ in range(size):
count += 1
return count
""" 线性阶 """
def linear(n):
""" 线性阶 """
count = 0
for _ in range(n):
count += 1
return count
""" 线性阶（遍历数组）"""
def array_traversal(nums):
""" 线性阶（遍历数组）"""
count = 0
# 循环次数与数组长度成正比
for num in nums:
count += 1
return count
""" 平方阶 """
def quadratic(n):
""" 平方阶 """
count = 0
# 循环次数与数组长度成平方关系
for i in range(n):
@ -40,8 +40,8 @@ def quadratic(n):
count += 1
return count
""" 平方阶（冒泡排序）"""
def bubble_sort(nums):
""" 平方阶（冒泡排序）"""
count = 0 # 计数器
# 外循环：待排序元素数量为 n-1, n-2, ..., 1
for i in range(len(nums) - 1, 0, -1):
@ -55,8 +55,8 @@ def bubble_sort(nums):
count += 3 # 元素交换包含 3 个单元操作
return count
""" 指数阶（循环实现）"""
def exponential(n):
""" 指数阶（循环实现）"""
count, base = 0, 1
# cell 每轮一分为二，形成数列 1, 2, 4, 8, ..., 2^(n-1)
for _ in range(n):
@ -66,26 +66,26 @@ def exponential(n):
# count = 1 + 2 + 4 + 8 + .. + 2^(n-1) = 2^n - 1
return count
""" 指数阶（递归实现）"""
def exp_recur(n):
""" 指数阶（递归实现）"""
if n == 1: return 1
return exp_recur(n - 1) + exp_recur(n - 1) + 1
""" 对数阶（循环实现）"""
def logarithmic(n):
""" 对数阶（循环实现）"""
count = 0
while n > 1:
n = n / 2
count += 1
return count
""" 对数阶（递归实现）"""
def log_recur(n):
""" 对数阶（递归实现）"""
if n <= 1: return 0
return log_recur(n / 2) + 1
""" 线性对数阶 """
def linear_log_recur(n):
""" 线性对数阶 """
if n <= 1: return 1
count = linear_log_recur(n // 2) + \
linear_log_recur(n // 2)
@ -93,8 +93,8 @@ def linear_log_recur(n):
count += 1
return count
""" 阶乘阶（递归实现）"""
def factorial_recur(n):
""" 阶乘阶（递归实现）"""
if n == 0: return 1
count = 0
# 从 1 个分裂出 n 个

6
codes/python/chapter_computational_complexity/worst_best_time_complexity.py
View File

@ -6,18 +6,18 @@ 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 *
""" 生成一个数组，元素为: 1, 2, ..., n ，顺序被打乱 """
def random_numbers(n):
""" 生成一个数组，元素为: 1, 2, ..., n ，顺序被打乱 """
# 生成数组 nums =: 1, 2, 3, ..., n
nums = [i for i in range(1, n + 1)]
# 随机打乱数组元素
random.shuffle(nums)
return nums
""" 查找数组 nums 中数字 1 所在索引 """
def find_one(nums):
""" 查找数组 nums 中数字 1 所在索引 """
for i in range(len(nums)):
# 当元素 1 在数组头部时，达到最佳时间复杂度 O(1)
# 当元素 1 在数组尾部时，达到最差时间复杂度 O(n)