题目描述：

LeetCode 649. Dota2 Senate

In the world of Dota2, there are two parties: the Radiant and the Dire.

The Dota2 senate consists of senators coming from two parties. Now the senate wants to make a decision about a change in the Dota2 game. The voting for this change is a round-based procedure. In each round, each senator can exercise one of the two rights:

1. Ban one senator's right:
   A senator can make another senator lose all his rights in this and all the following rounds.
2. Announce the victory:
   If this senator found the senators who still have rights to vote are all from the same party, he can announce the victory and make the decision about the change in the game.

Given a string representing each senator's party belonging. The character 'R' and 'D' represent the Radiant party and the Dire party respectively. Then if there are n senators, the size of the given string will be n.

The round-based procedure starts from the first senator to the last senator in the given order. This procedure will last until the end of voting. All the senators who have lost their rights will be skipped during the procedure.

Suppose every senator is smart enough and will play the best strategy for his own party, you need to predict which party will finally announce the victory and make the change in the Dota2 game. The output should be Radiant or Dire.

Example 1:

Input: "RD"
Output: "Radiant"
Explanation: The first senator comes from Radiant and he can just ban the next senator's right in the round 1. 
And the second senator can't exercise any rights any more since his right has been banned. 
And in the round 2, the first senator can just announce the victory since he is the only guy in the senate who can vote.

Example 2:

Input: "RDD"
Output: "Dire"
Explanation: 
The first senator comes from Radiant and he can just ban the next senator's right in the round 1. 
And the second senator can't exercise any rights anymore since his right has been banned. 
And the third senator comes from Dire and he can ban the first senator's right in the round 1. 
And in the round 2, the third senator can just announce the victory since he is the only guy in the senate who can vote.

Note:

1. The length of the given string will in the range [1, 10,000].

题目大意：

有两个阵营R和D，一个阵营的成员可以将另一个阵营的成员“禁言”。

假设两阵营的成员都采用最优策略。求最终剩下的具有发言权的阵营。

解题思路：

优先对排在自己之后并且距离自己最近的不同阵营成员禁言

根据该策略，将不同阵营的成员清除，循环直到只剩下一方阵营为止。

Python代码：

class Solution(object):
    def predictPartyVictory(self, senate):
        """
        :type senate: str
        :rtype: str
        """
        delta = 0
        while len(set(senate)) > 1:
            nsenate = ''
            for s in senate:
                if s == 'R':
                    if delta >= 0: nsenate += 'R'
                    delta += 1
                else:
                    if delta <= 0: nsenate += 'D'
                    delta -= 1
            senate = nsenate
        return {'D' : 'Dire', 'R' : 'Radiant'}[senate[0]]

 

本文链接：http://bookshadow.com/weblog/2017/07/30/leetcode-dota2-senate/
请尊重作者的劳动成果，转载请注明出处！书影博客保留对文章的所有权利。

如果您喜欢这篇博文，欢迎您捐赠书影博客： ，查看支付宝二维码