[강병준] Maximum Product Subarray #164

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.

Sign up for GitHub

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

Jump to bottom

Open

BangDori wants to merge 1 commit into main from bangdori/maximum-product-subarray

Member

BangDori commented May 27, 2025

0 곱하기와 음수 곱을 고려해야 해서 처음에는 0을 제거하고 음수 곱을 어떻게 처리할 지에 대해 고민하다가 틀렸습니다.

근데 음수를 체크하는 방식이 아닌 정방향 곱과 역방향 곱을 모두 확인하는 방법으로 문제를 해결할 수 있다는 힌트를 얻어서 풀었네요. 진짜 대박이네요


          [강병준] Maximum Product Subarray

b867298

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet