Add day19

[summer2788]

Day-19 / 박종은

문제 번호

1. 79_WordSearch
2. 212_WordSearchII
3. 621_TaskScheduler

(Optional) 공유하고 싶은 내용

212_WordSearchII

1. Consider the time complexity.
2. You can just pass the string . Don't be stuck in passing only reference variable

621_TaskScheduler

1. when you want to track the most left one which is not in the queue , Just create the data structure that only store the popped left one after processing.
2. Consider which thing to choose as an index . You might not have to choose obvious thing (A,B,C...)as an index that is given in the problem.

79_WordSearch

1. you can manipulate the parameter as well like below

board[i][j] = '#';

2. By calling function in if statement, the code can be organized and neat

if (dfs(board, word, index + 1, i - 1, j, m, n)
            || dfs(board, word, index + 1, i + 1, j, m, n)
            || dfs(board, word, index + 1, i, j - 1, m, n)
            || dfs(board, word, index + 1, i, j + 1, m, n)) {
            return true;
        }

3. you can reduce time by calling function if it only find the first char

if (board[i][j] == word[0]) {
                    if (dfs(board, word, 0, i, j, m, n)) {
                        return true;
                    }

[github-actions]

우측에 있는 Projects, Milestone, Development를 확인 후 할당 해주세요~! 🙇

[kinwjdghks]

정말 부지런하시군요...!

[jihostudy]

wow.. 알고리즘에 진심인 남자