BF算法
def bf(st, tem):
i = j = 0
while i < len(st) and j < len(tem):
if st[i] == tem[j]:
j += 1
else:
j = 0
i += 1
if j == len(tem):
return i - len(tem)
else:
return -1
if __name__ == '__main__':
print(bf('asdfasdx', 'dx'))
匹配括号
def match(s):
assert len(s) > 0
b = {')': '(', ']': '[', '}': '{'}
k = b.keys()
v = b.values()
l = []
for i in s:
if i in v:
l.append(i)
elif i in k:
if len(l) == 0 or l[-1] is not b.get(i):
return False
l.pop()
return len(l) == 0
if __name__ == '__main__':
print(match(input()))
回文链表
class LinkNode:
def __init__(self, d):
self.data = d,
self.next = None
def get_l(s):
s = list(map(int, s.split(" ")))
l = LinkNode(0)
p = l # 引用传递
for i in range(len(s)):
p.next = LinkNode(s[i])
p = p.next
return l.next
def palindrom(l):
if l is None:
return True;
s = f = l
while f.next is not None and f.next.next is not None:
s = s.next
f = f.next.next
h = s.next
q = reverser(h)
s.next = None
p = l
while p is not None and q is not None: # p和q都能为空,q为空循环完毕
if p.data == q.data:
p, q = p.next, q.next
else:
return False
if q is None: # q为空说明循环完毕了,说明匹配了
return True
return False
# 逆置链表
def reverser(h):
l = LinkNode(0)
p = h
while p is not None:
x = p.next # 保存当前项的指向
p.next = l.next # 当前项指向头结点的指向
l.next = p # 当前项指向头结点指向
p = x
return l.next
if __name__ == '__main__':
l = get_l(input())
print(palindrom(l))
生成螺旋矩阵
#生成螺旋矩阵,如下
# [1,2,3]
# [8,9,4]
# [7,6,5]
def spiral(n):
matrix = [[0] * n for _ in range(n)]
# 顺时针方向(右,下,左,上)
dx = [0, 1, 0, -1]
dy = [1, 0, -1, 0]
x = y = 0
dn = 0 # 方向指针0;向右填充,1:向下填充,2:向上填充,3:向上填充
for i in range(1, n * n + 1): # 从1开始赋值,一直到n*n
matrix[x][y] = i
temp_x = x + dx[dn]
temp_y = y + dy[dn]
if 0 <= temp_x < n and 0 <= temp_y < n and matrix[temp_x][temp_y] == 0:
x = temp_x
y = temp_y
else:
dn = (dn + 1) % 4
x += dx[dn]
y += dy[dn]
return matrix
if __name__ == '__main__':
n = int(input("输入矩阵n值:"))
matrix = spiral(n)
for i in range(n):
print(matrix[i])
移除列表元素
# 输入一个列表lt,判断val是否在lt中,如果在,将其删除,最后输出删除后的lt和lt的长度
def remove_element(lt, val):
k = 0
for i in range(len(lt)):
if lt[i] != val:
lt[k] = lt[i]
k += 1
return k
if __name__ == '__main__':
lt = list(map(int, input().split(' ')))
val = int(input())
k = remove_element(lt, val)
print(k) # 移除后的元素长度
print(' '.join(map(str, lt[:k]))) # 输出移除后的新列表: lt[:k],从0开始截取,截取k位
计算后缀表达式的值
def get_value(lt):
op = []
i = 0
while i < len(lt):
opv = lt[i]
if opv == "-":
a, b = op.pop(), op.pop()
op.append(b - a)
elif opv == "+":
a, b = op.pop(), op.pop()
op.append(a + b)
elif opv == "*":
a, b = op.pop(), op.pop()
op.append(a * b)
elif opv == "/":
a, b = op.pop(), op.pop()
op.append(b / a)
else:
op.append(lt[i])
i += 1
else:
return op[-1]
if __name__ == '__main__':
lt = [56, 20, '-', 4, 2, '+', '/']
print(get_value(lt))
顺时针旋转n维矩阵90度
# 先对角线交换,再垂直交换
# [[2,3,4],
# [5,6,7],
# [8,9,1]]
# 翻转90度为
# [[8,5,2],
# [9,6,3],
# [1,7,4]]
# 1先对角线翻转为
# [[2,5,8],
# [3,6,9],
# [4,7,1]]
# 2再水平翻转
# [[8,5,2],
# [9,6,3],
# [1,7,4]]
# 4*4
# [[8,5,2,9],
# [9,6,3,8],
# [1,7,4,4],
# [1,7,4,4]]
# 几层矩阵值,矩阵
def rotatin(n, matrix):
mat = matrix
# 对角线翻转
# 0,0 0,1<=>1,0 0,2<=>2,0
for i in range(n):
for j in range(n - i):
mat[i][j + i], mat[j + i][i] = mat[j + i][i], mat[i][j + i]
# 水平翻转
for x in range(n):
for y in range(n // 2): # 第一个与倒数第一个交换
mat[x][y], mat[x][-y - 1] = mat[x][-y - 1], mat[x][y]
return mat
if __name__ == '__main__':
n = int(input("输入矩阵数:"))
# matrix = [[2, 3, 4],
# [5, 6, 7],
# [8, 9, 1]]
matrix = []
for i in range(n):
lt = list(map(int, input("第" + str(i + 1) + "行矩阵:").split(" ")))
matrix.append(lt)
matr = rotatin(n, matrix)
for i in range(n):
for j in range(n):
if j == n - 1:
print(matr[i][j], end="")
else:
print(matr[i][j], end=" ")
print()
折半查找
# 折半查找
def BinSearch(R, k):
n = len(R)
low, high = 0, n - 1
while low <= high:
mid = (low + high) // 2
if k == R[mid]:
return mid
if k < R[mid]:
high = mid - 1
else:
low = mid + 1
return -1
if __name__ == '__main__':
x = list(map(int, input().split(" ")))
print(BinSearch(x, 3))
各大算法(python版本)
于 2022-01-04 15:21:51 首次发布
这篇博客涵盖了多种算法实现,包括BF算法进行字符串匹配,检查括号匹配的有效性,回文链表的判断,生成螺旋矩阵,移除列表元素,计算后缀表达式的值以及二维矩阵顺时针旋转90度。这些算法展示了对字符串处理、链表操作、矩阵变换和数学逻辑的深入理解。
摘要由CSDN通过智能技术生成