C++Python Greedy DP速解Leetcode 1014 Best Sightseeing Pair

C++Python Greedy DP速解Leetcode 1014  Best Sightseeing Pair算是貪婪演算還是動態規劃，其實都算解法類似Kadane演算法。

-----------

Leetcode 1014. Best Sightseeing Pair is considered greedy algorithm or dynamic programming, but it is actually both. It's similar to Kadane's Algorithm

[Py3 解答請進]

python Keras使用仿AlexNet針對oxflower達到100趴的辨識率實測

C++BFS走訪 level排序與DFS cycle長度計數解Leetcode 2471 Minimum Number of Operatio...

C++BFS走訪 level排序與DFS cycle長度計數解Leetcode 2471  Minimum Number of Operations to Sort a Binary Tree by Level

解圖論問題Leetcode 2471. Minimum Number of Operations to Sort a Binary Tree by Level，這不算稀奇，但當中還用到置換群(permutation group)的概念就比較特別。

------

Solve the graph theory problem Leetcode 2471. Minimum Number of Operations to Sort a Binary Tree by Level. This is not unusual, but the concept of permutation group is also used in it, which is quite special.

[codes on Leetcode]https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/solutions/6175677/bsf-levelwise-transversal-compare-with-s-l164/

[Tree Graph Playlist]https://www.youtube.com/watch?v=bna7aw7dkPY&list=PLYRlUBnWnd5Kt0-3un43cwY6yT_il8NWe