Py3 C++ C 2pointer速解Leetcode 11Container With Most Water

Py3 C++ C 2pointer速解Leetcode 11Container With Most Water

[Py3 code請進]

C++ Pascal三角與模10算術解Leetcode 2221 Find Triangular Sum of an Array(含Py3 Code)

C++ Pascal三角與模10算術解Leetcode 2221  Find Triangular Sum of an Array

如果採用有支援非常長int的程式語言，mod 10算術就整個省略，就用Pascal三角的性質，可得快速解

Py3 C++ dp動態規劃解Leetcode 1039 Minimum Score Triangulation of Polygon

Py3 C++ dp動態規劃解Leetcode 1039  Minimum Score Triangulation of Polygon

Py3 C++ dp動態規劃解Leetcode 1039  Minimum Score Triangulation of Polygon

凸多邊形三角化的問題，題目看起來很幾何，解法用動態規劃，多邊形的切割其實也是divide and conquer.

 [py3解請進]