Huawei computer test ~ offset realizes string encryption

1. Title Description ： Give the original string str, Encryption is achieved by changing each letter of the string , The encryption method is in every letter str[i] Offset a specific array element a[i] The amount of . Array a The first three digits of have been assigned ：a[0]=1,a[1]=2,a[2]=4, When i>=3 when , Array elements a[i]=a[i-1]+a[i-2]+a[i-3].

• for example ： original text abcde After encryption bdgkr, The offsets are 1,2,4,7,13.
• Input description ： The first line is an integer n, Express n Group test data . Each set of data contains a row , original text str( Contains only lowercase letters , Longer than 0 Less than 50).
• Output description ： Each group of test data output one line , It means ciphertext .

 // String offset  xy -> ya , abcde -> bdgkr
    public  static void  tm001(){
    
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()){
    
            String line1 = scanner.nextLine();
            int count = Integer.parseInt(line1);
            List<String> stringList = new ArrayList<>();
            int maxLen = 0;
            for (int i = 0; i < count; i++) {
    
                String input = scanner.nextLine();
                if (input.length() > maxLen){
    
                    maxLen = input.length();
                }
                stringList.add(input);
            }
            //  Calculate directly from the maximum length   Move step set   Calculate only once 
            int[] moveArr = new int[Math.max(maxLen, 3)];
            moveArr[0] = 1;
            moveArr[1] = 2;
            moveArr[2] = 4;
            for (int i = 3; i < maxLen; i++) {
    
                // When adding   Take the remainder   Prevent the stack from exceeding int Range 
             // in consideration of  Integer.MAX_VALUE = 2147483647, Directly remainder the result   Ensure that each number is not greater than 26
                moveArr[i]  = (moveArr[i-1] + moveArr[i-2] + moveArr[i-3]) % 26;// 26 Letters 
            }

            for (String line : stringList) {
    
                char[] chars = line.toCharArray();
                StringBuilder stringBuilder = new StringBuilder();
                for (int i = 0; i < chars.length; i++) {
    
                    int move = moveArr[i];
                    // 'a' = 97 , 'z' = 122
                    //  prevent   appear 25 + 25  Etc. greater than  26 The situation of   Take the mold again 
                    int result = ((chars[i] - 97) + move)%26 + 97; // 26 Letters   Subscript from 0 Start ~25
                    stringBuilder.append((char)result);
                }
                System.out.println(stringBuilder);
            }
        }
    }