g0701_0800.s0788_rotated_digits.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

package g0701_0800.s0788_rotated_digits;

// #Medium #Dynamic_Programming #Math #2022_03_26_Time_2_ms_(98.95%)_Space_39.6_MB_(87.35%)

public class Solution {
    public int rotatedDigits(int n) {
        int[] flag = new int[n + 1];
        flag[0] = 2;
        int[] indexesValueTwo = {1, 8};
        for (int value : indexesValueTwo) {
            if (n >= value) {
                flag[value] = 2;
            }
        }
        int[] indexesValueOne = {2, 5, 6, 9};
        for (int value : indexesValueOne) {
            if (n >= value) {
                flag[value] = 1;
            }
        }
        int rs = 0;
        for (int i = 1; i <= n; i++) {
            int residual = i % 10;
            if (flag[residual] != 0) {
                if ((residual == 1 || residual == 0 || residual == 8) && (flag[i / 10] == 2)) {
                    flag[i] = 2;
                    continue;
                }
                if (flag[i / 10] != 0) {
                    flag[i] = 1;
                    rs++;
                }
            }
        }
        return rs;
    }
}