我最近在刷lettcode的算法题目,想用python尝试一下,感觉我的运行结果是这样的,但是我不知道提交的格式是什么样的,所以,我就只能像保存在博客里面,以后再慢慢修改了。
class Solution:
def findMinstep(self):
board = input('输入桌上的球:"')
hand = input('输入手中含有的球:')
if len(board)<20 and len(hand) <5 :
board = list(board)
hand = list(hand)
for j in range(len(board)):
self.check(board,hand)
else:
print('球数超量!')
self.findMinstep()
if board:
print('桌上的球已清理完毕')
else:
print('桌上的球已清理完毕')
def check(self ,board, hand):
qiu = ['R', 'Y', 'B', 'G', 'W']
for zhuo_qiu in board:
if zhuo_qiu in qiu:
for i in range(len(board)-1):
if i+1 < len(board):
if board[i] == board[i+1]:
for j in hand:
if board[i]==j and board[i+1]==j:
hand.remove(j)
del board[i]
del board[i]
continue
else:
print('桌上的球错误!')
self.findMinstep()
y = Solution()
y.findMinstep()