[置頂]ECDSA

什麼是ECDSA?

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解請進

貪婪計數Python C++解Leetcode 2491 Divide Players Into Teams of Equal Skill

貪婪計數Python C++解Leetcode 2491  Divide Players Into Teams of Equal Skill

貪婪演算+counting sort加上2-pointer這樣就完成打敗100趴的快速C++解答[Python code請進]

-----

C++採Catalan數的遞迴DP方式計算Leetcode 241 Different Ways to Add Parentheses

C++採Catalan數的遞迴DP方式計算Leetcode 241  Different Ways to Add Parentheses

每個數字都是葉節點，而+、-、*操作則不是。算術公式的 dfs 走訪等價於其對應的帶括號的 inOrder 算式。

-----

Python C++ bitmask解Leetcode 1371 Find the Longest Substring Containing ...

Python C++ bitmask解Leetcode 1371  Find the Longest Substring Containing Vowels in Even Counts

建構一個容器first_seen[32]（5個母音考慮2**5=32），它表示第一次看到的32不同bmask的索引

[Python code請進]

-----