题解 | 参议院投票
参议院投票
https://www.nowcoder.com/practice/f334a81b22654efc8d7a67e31f60de50
#感觉还是挺绕的,不会用队列的方法来坐着道题
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
# 求出最终获胜帮派的名称
# @param s string字符串
# @return string字符串
#
class Solution:
def predictVictory(self , s: str) -> str:
# write code here
st = s
while(st.count("D")>=1 and st.count("R")>=1):
for i in range(len(st)):
if st[i] =="D":
index = st.find("R")
# print(index)
if index == -1:
break
else:
s = st[i+1:index] +st[index+1:] +st[i]
break
print(s)
else:
index = st.find("D")
if index == -1:
break
else:
s = st[i+1:index] +st[index+1:] +st[i]
break
st = s
# print(st)
return "Red" if st.count("D") == 0 else "Dark"
