
**解析:**Version 1,按讲述的规则实现即可,最后其实会发现结果始终是n-1。
class Solution:
def numberOfMatches(self, n: int) -> int:
total = 0
while n != 1:
matches = n // 2
total += matches
if n % 2 == 0:
n = matches
else:
n = matches + 1
return total
# return n - 1