LeetCode每日一题(Decoded String at Index)

给定一个编码字符串s,按照特定规则解码成一个纸带。解码过程从左到右逐个字符读取,遇到字母就写到纸带上,遇到数字d则将当前纸带内容重复写入d-1次。根据k返回解码后的第k个字符(1-based)。例如,s='leet2code3',k=10,解码后的字符串为'leetleetcodeleetleetcodeleetleetcode',第10个字符为'o'。
摘要由CSDN通过智能技术生成

You are given an encoded string s. To decode the 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 d, the entire current tape is repeatedly written d - 1 more times in total.
Given an integer k, return the kth letter (1-indexed) in the decoded string.

Example 1:

Input: s = “leet2code3”, k = 10
Output: “o”

Explanation:
The decoded string is “leetleetcodeleetleetcodeleetleetcode”.
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”

</
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值