【2020秋招笔试】马蜂窝

给出一棵满二叉树的层次遍历，和一个节点n.
输出中序遍历的n的下一个节点

输入
1,2,3,4,5,6,7,8
5
输出
3

import sys
import math

line = sys.stdin.readline().strip()
nums = list(map(int, line.split(',')))
n = int(sys.stdin.readline().strip())
num = 0
for i in range(int(math.sqrt(n + 1))+1):       
    num += int(pow(2,i))
num -= 1
if(n not in nums):
    print(-1)
else:
    pos = nums.index(n)
    if(pos == num):
        print(-1)
    elif(pos <= n//2):
        print(nums[(pos+1) * 2])
    else:
        print(nums[(pos-1)//2+1])

旅行问题，从原点出发，然后回原点的最短路
暴力回溯，正解应该是dp

import sys
from collections import defaultdict
num, coun, minn = 0, 0, 100010
def dfs(cur):
    global num, coun, vis, minn      
    if(coun == n-1):
        minn = min(num, minn)                 
        return 
    for i in range(1, n):
        if(cur != i and vis[i] != 1):
            vis[i] = 1
            num += path[cur][i]  
            coun += 1        
            dfs(i)
            vis[i] = 0
            coun -= 1
            num -= path[cur][i]

line = sys.stdin.readline().strip()
paths = list(map(str, line.split('#')))
path = []
n = len(paths)
vis = [0 for i in range(n)]
for i in range(n):
    path.append(list(map(int, paths[i].split(','))))
dfs(0)
q = 1000010
for i in range(1,n):
    q = min(minn + path[i][0], q)
print(q)