解题思路:
广度搜索bfs。
注意事项:
参考代码:
if __name__ == '__main__': n = int(input().strip()) s = input().strip() queen = [[s,0]] states = [] if s.count('2') < 2 or s.count('1') < 1 or s.count('0') < 1: print(-1) else: if '2012' in s: print(0) else: flag = 0 while queen: now_state = queen.pop(0) states.append(now_state[0]) for i in range(n-1): temp = now_state[0][:i]+now_state[0][i+1]+now_state[0][i]+now_state[0][i+2:] if '2012' in temp: print(now_state[1]+1) flag = 1 break if temp not in states: queen.append([temp,now_state[1]+1]) if flag: break
0.0分
1 人评分