牛客网学习笔记——中等题们

最新推荐文章于 2024-10-12 12:26:23 发布

2023好运来

最新推荐文章于 2024-10-12 12:26:23 发布

阅读量260

点赞数 1

分类专栏：学习记录文章标签：学习

本文链接：https://blog.csdn.net/qq_43656500/article/details/123815064

版权

学习记录专栏收录该内容

103 篇文章 0 订阅

订阅专栏

HJ63 DNA序列

在这里插入图片描述

def find(s):
    re = 0
    for i in range(len(s)):
        if s[i] == 'G' or s[i] == 'C':
            re += 1
    return re 
    
while True:
    try:
        s = input()
        n = int(input())
        re = 0
        res = ''
        for i in range(len(s)-n+1):
            re_ = find(s[i:i+n])
            res_ = s[i:i+n]
            if re_ > re:
                res = res_
                re = re_
        print(res)
    except:
        break

HJ43 迷宫问题

在这里插入图片描述

def walk(i,j,pos):
    if j+1<n and maze[i][j+1] == 0:
        if (i,j+1) not in pos:
            walk(i,j+1,pos+[(i,j+1)])
    if j-1 >= 0 and maze[i][j-1] == 0:
        if (i,j-1) not in pos:
            walk(i,j-1,pos+[(i,j-1)])
    if i+1<m and maze[i+1][j] == 0:
        if (i+1,j) not in pos:
            walk(i+1,j,pos+[(i+1,j)])
    if i-1 >= 0 and maze[i-1][j] == 0:
        if (i-1,j) not in pos:
            walk(i-1,j,pos+[(i-1,j)])
    if (i,j) == (m-1,n-1):
        for p in pos:
            print('(' + str(p[0]) + ',' + str(p[1]) + ')')

while True:
    try:
        m, n = list(map(int, input().split()))
        maze = []
        for _  in range(m):
            maze.append(list(map(int, input().split())))

        pos = [(0,0)]
        walk(0,0,pos)
    except:
        break

学习大佬写的

while True:
    try:
        n, m = [int(x) for x in input().split()]
        maze = []
        for i in range(n):
            maze.append([int(x) for x in input().split()])

        points = []
        for i in range(n):
            points.append([])
            for j in range(m):
                points[i].append(0)

        path = []

        def get_points(i,j,maze,points):
        #     print('test3',i,j)
            k = []
            if(0 <= i+1 < n and maze[i+1][j] == 0 and points[i+1][j] == 0):
                k.append([i+1,j])
            if(0 <= i-1 < n and maze[i-1][j] == 0 and points[i-1][j] == 0):
                k.append([i-1,j])
            if(0 <= j+1 < m and maze[i][j+1] == 0 and points[i][j+1] == 0):
                k.append([i,j+1])
            if(0 <= j-1 < m and maze[i][j-1] == 0 and points[i][j-1] == 0):
                k.append([i,j-1])
        #     print('test4',k)
            return k

        def get_path(i,j,maze,path,points):
            global res
            k = get_points(i,j,maze,points)
            points[i][j] = 1
        #     print('test2',k)
            if(len(k) > 0):
                for num1 in range(len(k)):
                    if(num1 == 0):
                        path.append(k[num1])
                    else:
                        path[-1] = k[num1]
                    if(k[num1] == [n - 1,m - 1]):
                        if(len(res) == 0 or len(path) < len(res)):
                            res = path
                    else:
                        tpath = path.copy()
                        tpoints = points.copy()
        #                 print('test1',tpath,tpoints)
                        get_path(k[num1][0],k[num1][1],maze,tpath,tpoints)

        global res
        res = []

        get_path(0,0,maze,path,points)

        print('(0,0)')
        for num2 in range(len(res)):
            print('(%d,%d)'%(res[num2][0],res[num2][1]))
    except:
        break