[置頂]ECDSA

什麼是ECDSA?

Python C++ sliding window速解Leetcode 1652 defuse the bomb

Leetcode的1652. Defuse the Bomb是絕佳的練習題，特別是針對Python的使用者，雖說是sliding window 是簡單的那種，還可練習loop, slicing, minus index etc .https://leetcode.com/problems/defuse-the-bomb/solutions/6056351/sliding-window-for-k-0-or-k-0-beats-100/

bitset C++ python解Leetcode 3133 Minimum Array End

bitset C++ python解Leetcode 3133  Minimum Array End

簡單地說就是把x和n-1的二進位塞成一個數字

-----------

Roughly speeaking, "pack" the binary expressions of x & n-1 into one number

XOR prefix sum C++ python解Leetcode 1829 Maximum XOR for Each Query

XOR prefixsum CPP python解Leetcode 1829  Maximum XOR for Each Query

其實這裡考慮的是元素個數為2^maximumBit的交換群，運算子為XOR。

[Python code請進]

2 pointer Python C++解Leetcode 3163 String Compression III

2 pointer Python C++解Leetcode 3163  String Compression III

[codes on Leetcode]https://leetcode.com/problems/string-compression-iii/solutions/6004059/string-with-2-pointers-3ms-beats-99-15/

[2-pointer/Sliding window play list]https://www.youtube.com/watch?v=--IlX3x54nk&list=PLYRlUBnWnd5KrCfs7qCFb-Bvn7dvnakFy

Colab上安裝中文字型修改股市爬蟲pyplot顯圖

Colab上安裝中文字型修改股市爬蟲pyplot顯圖

使用python套件：

numpy, requests. pyplot, matplotlib.font_manager, matplotlib.mpl

黑柴犬康芮颱風後行走

Python C++使用字串find迴圈速解Leetcode 2490 Circular Sentence

Python C++使用字串find迴圈速解Leetcode 2490  Circular Sentence

C++ & Python都有字串的find，用法都類似

split=s.find(' ', split+1)能找到s從index=split+1開始出現' '的第一個的index

[Python解請進, C++ 一行解]

C++ Python DFS與nth element( nlargest)Leetcode 2583 Kth Largest Sum in a...

Python C++ DFS與nth element nlargest解Leetcode 2583  Kth Largest Sum in a Binary Tree

用容器一次就配置大一點，寧可大一點不要不夠，解答的Code才會夠快。 解答快速程式簡單。

[Python解答請進]

----------

Python C++ heap priority queue速解L eetcode 2530 Maximal Score After Appl...

Python CPP heap priority queue速解L eetcode 2530. Maximal Score After Applying K Operations

heap/priority queue是重要的資料結構，無論是C++的std::priority_queue或是python的heapq都可以拿來練習這題用貪婪演算可解的問題

----------

Python解請進