-
Notifications
You must be signed in to change notification settings - Fork 4
[2주차] 배수빈 #18
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
line[i] = Integer.parseInt(br.readLine()); | ||
} | ||
|
||
// 이분탐색으로 최장부분증가수열 구하기 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
이제까지 DP로만 최장부분증가수열을 풀었었는데, 이분탐색으로 하는 방법 신기하네요,,👍
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
수열의 크기가 100만이 넘어가면 DP로 못풀고 이분탐색으로 풀어야되군요,,,,
} | ||
return dif==1; | ||
} | ||
private static void dfs(String cur, String target, String[] words, boolean[] visited, int cnt) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
dfs로 푸니 단어의 변환을 더 직관적으로 확인할 수 있는 것 같습니다 👍
No description provided.