August 18, 2021 daily

05:00 streching, jogging

05:45~06:50 leetcode

-Android Unlock Pattern: https://leetcode.com/explore/interview/card/google/62/recursion-4/484/

 

class Solution {
public:
    vector<vector<int>> directions = {{0, 1}, {1, 0}, {-1, 0}, {0, -1},
                                      {1, 1}, {1, -1}, {-1, 1}, {-1, -1},
                                      {1, 2}, {1, -2}, {2, 1}, {2, -1},
                                      {-1, 2}, {-1, -2}, {-2, 1}, {-2, -1}
                                     };
    
    int visited[3][3];
    
    int traverse(int y, int x, int m, int n, int d){
        int ret = 0;
        if(y < 0 || y > 2 || x < 0 || x > 2){
            return 0;
        }
        
        if(n < d){
            return 0;
        }
        
        if(visited[y][x] != 0){
            return 0;
        }
        visited[y][x] = 1;
        
        if(m <= d){
            ret += 1;
        }
        
        for(auto direction: directions){
            int yAxis = y + direction[0];
            int xAxis = x + direction[1];
            
            if(yAxis < 0 || yAxis > 2 || xAxis < 0 || xAxis > 2) continue;
            
            if(visited[yAxis][xAxis] != 0){
                ret += traverse(yAxis + direction[0], xAxis + direction[1], m, n, d + 1);
            } else {
                ret += traverse(yAxis, xAxis, m, n, d + 1);
            }
        }
        visited[y][x] = 0;
        return ret;
    }
    
    int numberOfPatterns(int m, int n) {
        int ans = 0;
        for(int i = 0; i < 3; i++){
            for(int j = 0; j < 3; j++){
                ans += traverse(i, j, m, n, 1);
            }
        }
        return ans;
    }
};

마지막 케이스에서 타임아웃이라 개선 필요

 

17:00~18:00 weight training(chest)