g1201_1300.s1291_sequential_digits.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1201_1300.s1291_sequential_digits;
// #Medium #Enumeration #Udemy_Arrays #2022_03_10_Time_0_ms_(100.00%)_Space_42_MB_(5.03%)
import java.util.ArrayList;
import java.util.List;
public class Solution {
public List sequentialDigits(int low, int high) {
int[] arr = {
12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456,
4567, 5678, 6789, 12345, 23456, 34567, 45678, 56789, 123456, 234567, 345678, 456789,
1234567, 2345678, 3456789, 12345678, 23456789, 123456789
};
List result = new ArrayList<>();
for (int j : arr) {
// 234 148 234 256
if (j >= low && j <= high) {
result.add(j);
}
}
return result;
}
}