Given an array of integers arr, replace each element with its rank. The rank represents how large the element is. The rank has the following rules:

我们定义「顺次数」为：每一位上的数字都比前一位上的数字大 1 的整数。 请你返回由 [low, high] 范围内所有顺次数组成的 有序 列表（从小到大排序）。   示例 1： 输出：low = 100, high = 300 输出：[123,234] 示例 2： 输出：low = 1000, high = 13000 输出：[1234,2345,3456,4567,5678,6789,12345]   提示：

An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits.   Example 1: Input: low = 100, high = 300…

给你一个整数数组 nums。 请你统计所有满足以下条件的 非空 子序列 对 (seq1, seq2) 的数量：

You are given an integer array nums. Your task is to find the number of pairs of non-empty subsequences (seq1, seq2) of nums that satisfy the following conditions:

给你一个整数 n。请你计算以下两个值的 最大公约数（GCD）：

You are given an integer n. Your task is to compute the GCD (greatest common divisor) of two values:

给你一个长度为 n 的整数数组 nums。

You are given an integer array nums of length n. Construct an array prefixGcd where for each index i: