python - 黑客在 python 中排名交替字符？

Question

我一直在努力解决Hacker Rank alternating character problem但我卡住了。任何人都可以解释或更好地解决这个问题。谢谢!

print("Enter the number of test cases: ")
T = int(input())
line = T
while line > 0:
    test_string = input()
    i = 0
    counter = 0
    while i < (len(test_string)):        
        if (test_string[i - 1] == test_string[i] and len(test_string) > 2):
            test_string = test_string[i:]
            counter += 1                    
        elif (len(test_string) <= 2):
            break
        i += 1
    print (counter)        
    line -= 1

Answer 1

如果前一个字符与当前字符相同，我们只需要删除一个字符:

T = int(input()) # get how many test cases
for test in range(T): # loop in range T test cases 
    line = input() # get each test 
    prev, changes  = line[0], 0
    for ch in line[1:]:
        if prev == ch:
            changes += 1
        prev = ch            
 print (changes)

或者使用 sum 和 range 获取所有分组:

T = int(input())
for test in range(T):
    line = input()
    print(sum(line[i:i+2]  in {"BB","AA"}  for i in range(len(line))))