Alice and Bob are playing a game. Initially, Alice has a string word = "a".
You are given a positive integer k.
Now Bob will ask Alice to perform the following operation forever:
word to its next character in the English alphabet, and append it to the original word.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 enough operations have been done for word to have at least k characters.
Note that the character 'z' can be changed to 'a' in the operation.
Example 1:
Input: k = 5
Output: "b"
Explanation:
Initially, word = "a". We need to do the operation three times:
"b", word becomes "ab"."bc", word becomes "abbc"."bccd", word becomes "abbcbccd".Example 2:
Input: k = 10
Output: "c"
Constraints:
1 <= k <= 500class Solution {
public char kthCharacter(int k) {
StringBuilder sb = new StringBuilder("a");
int len = 1;
while (len < k) {
for (int i = 0; i < len; i++)
sb.append((char) (((sb.charAt(i) - 'a' + 1) % 26) + 'a'));
len = sb.length();
}
System.out.println(sb);
return sb.charAt(k - 1);
}
}class Solution {
public char kthCharacter(int k) {
StringBuilder sb = new StringBuilder("a");
int len = 1;
while (len < k) {
for (int i = 0; i < len; i++)
sb.append((char) (((sb.charAt(i) - 'a' + 1) % 26) + 'a'));
len = sb.length();
}
System.out.println(sb);
return sb.charAt(k - 1);
}
}