LintCode——Chalkboard XOR Game(黑板游戏)

黑板游戏:

We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses. (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)

Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.

Return True if and only if Alice wins the game, assuming both players play optimally.

样例：

Input: nums = [1, 1, 2]
Output: false

Python：

 class Solution:
     """
     @param nums: a list of integers
     @return: return a boolean
     """
     def xorGame(self, nums):
         # write your code here
         result = 0
         for i in nums:
             result = result ^ i
         if result == 0 or len(nums) % 2 == 0:
             return True
         else:
             return False