본문 바로가기

0/leetcode

39. Combination Sum

You are allowed to use same element AGAIN.

1. Start from 0 index.

2. You don't need to start over from 0 index again but current index.

3. Make sure you copy current array [:]. DON'T pass reference.

 

반응형

'0 > leetcode' 카테고리의 다른 글

5. Longest Palindromic Substring  (0) 2026.03.23
33. Search in Rotated Sorted Array  (0) 2026.03.22
53. Maximum Subarray 풀이  (0) 2020.11.18
139. Word Break 풀이  (0) 2020.11.17
5. Longest Palindromic Substring 풀이  (0) 2020.11.11