1291. Sequential Digits

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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 Output: [123,234]Example 2: Input: low = 1000, high = 13000 Output: [1234,2345,3456,4567,5678,6789,12345]C..
Algorithm/LeetCode 2022. 1. 30. 10:30
941. Valid Mountain Array

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array of integers arr, return true if and only if it is a valid mountain array. Recall that arr is a mountain array if and only if: arr.length >= 3 There exists some i with 0 arr[i + 1] > ... > arr[arr.length - 1] Example 1: Input: arr = [2,1] Output: false Example 2..
Algorithm/LeetCode 2022. 1. 29. 10:30
1