C++ dp動態規劃解Leetcode 3459 Length of Longest V Shaped Diagonal Segment

C++ dp動態規劃解Leetcode 3459  Length of Longest V Shaped Diagonal Segment

採DP動態規劃迭代版本解難題，需要定義V-shaped distance

------

Using the DP dynamic programming iterative version, it is necessary to define the V-shaped distance

[codes on Leetcode]https://leetcode.com/problems/length-of-longest-v-shaped-diagonal-segment/solutions/7126168/dp-recursive-dfs-or-iteration-beats-100/

[DP動態規劃Playlist]https://www.youtube.com/watch?v=30yq3fmE6E8&list=PLYRlUBnWnd5K_XYUesV9oc6M9ONXII61T