Description
Alice and Bob are playing a game. Initially, Alice has a string word = "a".
You are given a positive integer k. You are also given an integer array operations, where operations[i] represents the type of the ith operation.
Now Bob will ask Alice to perform all operations in sequence:
- If
operations[i] == 0, append a copy ofwordto itself. - If
operations[i] == 1, generate a new string by changing each character inwordto its next character in the English alphabet, and append it to the originalword. For example, performing the operation on"c"generates"cd"and performing the operation on"zb"generates"zbac".
Return the value of the kth character in word after performing all the operations.
Note that the character 'z' can be changed to 'a' in the second type of operation.
Β
Example 1:
Input: k = 5, operations = [0,0,0]
Output: "a"
Explanation:
Initially, word == "a". Alice performs the three operations as follows:
- Appends
"a"to"a",wordbecomes"aa". - Appends
"aa"to"aa",wordbecomes"aaaa". - Appends
"aaaa"to"aaaa",wordbecomes"aaaaaaaa".
Example 2:
Input: k = 10, operations = [0,1,0,1]
Output: "b"
Explanation:
Initially, word == "a". Alice performs the four operations as follows:
- Appends
"a"to"a",wordbecomes"aa". - Appends
"bb"to"aa",wordbecomes"aabb". - Appends
"aabb"to"aabb",wordbecomes"aabbaabb". - Appends
"bbccbbcc"to"aabbaabb",wordbecomes"aabbaabbbbccbbcc".
Β
Constraints:
1 <= k <= 10141 <= operations.length <= 100operations[i]is either 0 or 1.- The input is generated such that
wordhas at leastkcharacters after all operations.
Solution
Python3
class Solution:
def kthCharacter(self, k: int, operations: List[int]) -> str:
res = (k - 1) & sum(v << i for i,v in enumerate(operations))
return chr(ord('a') + res.bit_count() % 26)