【港】Leetcode 980. Unique Paths III

No.
One Question a day is good enough for me.

【港】Leetcode 389. Find the Difference
https://youtu.be/1gZDA3zmlYY

介唔介意講吓 點樣可以快啲諗到DP solution？ 經常都做唔到DP題目

Btw 支持

好，今個星期。

係dp之前要推recurrence
推recurrence要靠mi
mi好難

最近呢兩個月開始玩leetchode
本身好鍾意coding
今日好奇呢度search下leetcode就見到樓主d post
以後會多多支持
Unique Paths III果條個algorithm真係好難諗
我諗左半日都唔知點做, 但睇個solution原來唔係咁複雜

Thanks.
感謝。

今日見到有條幾有趣既問題:

https://stackoverflow.com/questions/64221954/find-optimal-combination-of-values-of-a-dictionary-of-lists-perhaps-with-pandas

我只係諗到用combination sum去計，其實仲有冇得optimize?

應該係sort咗先。
邊個city多features行先，用咗別個features就mark，dfs落下一個第二多unmarked features嘅city得