leetcode - Decoded String at Index - java

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.

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”
Explanation:
The decoded string is “a” repeated 8301530446056247680 times. The 1st letter is “a”.

看到这道题第一时间想的是用StringBuilder将S展开成一个length为K的字符串，返回最后一个字符就OK了，但这个题不可能这么简单，字符串达到一定长度肯定会报内存溢出，先把自己的代码贴出来，也就是长度达到一定程度就会OOM的solution

public static String decodeAtIndex(String S, int K) {
        StringBuilder sb = new StringBuilder();
        StringBuilder sum;
        char c;
        for (int i = 0;i < S.length();i++){
            c = S.charAt(i);
            if (!Character.isDigit(c)){
                sb.append(c);
            }else {
                sum = new StringBuilder();
                for (int j = 0; j < c - 48; j++) {
                    sum.append(sb.toString());
                }
                sb = new StringBuilder(sum.toString());
            }
            if (sb.length() >=K){
                break;
            }
        }
        String s = sb.toString();
        return s.substring(K-1,K);
    }

然后看一个大佬的想法，也就相当于我的解法是将问题具体化了，大佬的解法是将问题抽象化，这种抽象思维以后要好好学习。

public static String decodeAtIndex(String S, int K) {
        long size = 0;
        int n = S.length();
        for (int i = 0; i < n; i++) {
            char c = S.charAt(i);
            if (Character.isDigit(c)) {
                size *= c - '0';
            } else {
                size++;
            }
        }

        for (int i = n - 1; i >= 0; i--) {
            char c = S.charAt(i);
            K %= size;
            if (K== 0 && Character.isLetter(c)) {
                return Character.toString(c);
            }
            if (Character.isDigit(c)){
                size = size / (c-'0');
            }else{
                size--;
            }
        }
        return null;
    }

自己敲完思考了一下，这种思维确实得好好学学，循环取余这种其实搞懂就会很简单。