Python/C++ Geedy演算完美切割解難題Leetcode 2551 Put Marbles in Bags

Geedy演算完美切割解難題Leetcode 2551 Put Marbles in Bags 要找到所有切割的最大和最小score，可以使用兩種方法：排序切割score（partition[i] = weights[i] + weights[i+1]）或使用堆（C++ priority_queue）。一旦score排序或存儲在堆中，就可以輕鬆識別最大和最小score。

backtracking solves 8 queens by C++八后問題展示回遡解答

backtracking solves 8 queen by C++. Visualize the solving process by own C++/openCV program. Base on my C++ code solving Leetcode 51. N-Queens. There are exact 92 solutions for 8 queens. Some of them will be shown.