C++ python高斯小學公式解Leetcode 1759 Count Number of Homogenous Substrings

C++ python高斯小學公式解Leetcode 1759  Count Number of Homogenous Substrings

高斯小學公式解1+2+...+n=n(n+1)/2 就 O(1)時間，不用它也行改用迴圈需時O(n)。解Leetcode 1759. Count Number of Homogenous Substrings也很好用，O(n)時間，O(1)空間，如果還要優化，就考慮平行化，這裡似乎有難度，空間就多用點。

[codes on Leetcode]https://leetcode.com/problems/count-number-of-homogenous-substrings/solutions/4266521/c-python-sum-of-n-n-1-2-0-ms-beats-100/

[Leetcode playList]https://www.youtube.com/watch?v=odbN3KooN8s&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

C++ python prefix Sum與pyplot圖解打怪問題Leetcode 1921 Eliminate Maximum Numb...

C++ python  prefix Sum與pyplot圖解打怪問題Leetcode 1921  Eliminate Maximum Number of Monsters

[Leetcode playList]https://www.youtube.com/watch?v=odbN3KooN8s&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

[Codes on Leetcode]https://leetcode.com/problems/eliminate-maximum-number-of-monsters/solutions/4258968/c-o-n-prefix-sum-52ms-beats-100-w-pyplot-fig/

AI人工智慧 神經網路模型之2 單一神經元python numpy計算

Python請進

C++優先佇列priority queue解Leetcode 1845 Seat Reservation Manager

CPP優先佇列priority queue解Leetcode 1845  Seat Reservation Manager

[Leetcode playList]https://www.youtube.com/watch?v=odbN3KooN8s&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk

[Codes on Leetcode]https://leetcode.com/problems/seat-reservation-manager/solutions/4254433/c-priority-queue-vs-set-vs-bool-array-214ms-beats-100/