/**
1602 · Decoded String at Index
Algorithms
Medium
Accepted Rate
56%
DescriptionSolutionNotesDiscussLeaderboard
Description
An encoded string S is given. To find and write the decoded string to a tape, the encoded string is read one character at a time and the following steps are taken:
If the character read is a letter, that letter is written onto the tape.
If the character read is a digit (say d), the entire current tape is repeatedly written d-1 more times in total.
Now for some encoded string S, and an index K, find and return the K-th letter (1 indexed) in the decoded string.
2 <= S.length <= 100
S will only contain lowercase letters and digits 2 through 9.
S starts with a letter.
1 <= K <= 10^9
The decoded string is guaranteed to have less than 2^63 letters.
Example
Example 1:
Input: S = “lint2code3”, K = 10
Output: “o”
Explanation:
The decoded string is “lintlintcodelintlintcodelintlintcode”.
The 10th letter in the string is “o”.
Example 2:
Input: S = “ha22”, K = 5
Output: “h”
Explanation:
The decoded string is “hahahaha”. The 5th letter is “h”.
Example 3:
Input: S = “a2345678999999999999999”, K = 1
Output: “a”
Explanation:
The decoded string is “a” repeated 8301530446056247680 times. The 1st letter is “a”.
Tags
Company
National Instruments
http://wxnacy.com/2018/11/07/go-rune-string/
https://blog.csdn.net/weixin_30352191/article/details/95845378
https://www.lintcode.com/problem/1602/
*/
/**
* @param S: An encoded string.
* @param K: An index.
* @return: Return the K-th letter (1 indexed) in the decoded string.
*/
func decodeAtIndex(S string, K int) string {
// Write your code here.
var size int64 = 0
var N int = len(S)
for i := 0; i < N; i++ {
var c rune = rune(S[i])
if unicode.IsDigit(c) {
size *= int64(c - '0')
} else {
size += 1
}
}
for i := N - 1; i >= 0; i-- {
var c rune = rune(S[i])
K %= int(size)
if K == 0 && unicode.IsLetter(c) {
return string(c)
}
if unicode.IsDigit(c) {
size /= int64(c - '0')
} else {
size -= 1
}
}
return ""
}