2025資訊安全Steganography隱寫術Python實作

Py3 C++ DFS解Leetcode難題1298 Maximum Candies You Can Get from Boxes

Py3 C++ DFS解Leetcode難題1298  Maximum Candies You Can Get from Boxes

[codes on Leetcode]https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/solutions/6805859/dfs-bfs-for-a-tree-beats-100/

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

C++Py3重複組合排容原理解Leetcode2929 Distribute Candies Among Children II

C++Py3重複組合排容原理解Leetcode2929  Distribute Candies Among Children II

Use combinatorial number with repetition & Inclusion-Exclusion Prinple to solve

[Py3解請進]

C++ DFS BFS解答Leecode難題3373 Maximize the Number of Target Nodes After Co...

C++ DFS BFS解答Leecode難題3373  Maximize the Number of Target Nodes After Connecting Trees II

圖論問題，跟bipartite有關

 ------------

Graphic question is related to the bipartite.

[codes on Leecode]https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/solutions/6791084/dfs-bfs-with-parity-bitset-beats-100/

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

2025 AES 像素pixel加密圖檔解密

2025 C++ opencv卷積計算與影像處理

C++ Py3計數解Leetcode 2131 Longest Palindrome by Concatenating Two Letter ...

C++ Py3計數解Leetcode 2131  Longest Palindrome by Concatenating Two Letter Words

回文問題常被問到。這題基本上可以用計數的方法來解決。重點是兩個字母的字串 xy 和 yx 可以配對。

-----

Palindrome question is quite often asked. This question can be solved basically by using counting. It's important to know the 2-letter strings xy & yx can be paired.

[codes on Leetcode]https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/solutions/6778069/2d-array-counter-freq-count-c-c-py3-beats-100/

[C, C++ ,python速解迴文Leetcode 2108 Find First Palindromic String in the Array]https://www.youtube.com/watch?v=eXhdv8jDpao

C++ opencv selectROI擷圖與馬賽克

2025 AES opencv python圖檔加密

opencv C++使用卷積convolution/correlation進行影像處理

 

 opencv C++使用卷積convolution/correlation進行影像處理