人與黑柴狗奔跑

C++ Py3 bitmask速解Leetcode 762 Prime Number of Set Bits in Binary Representation

C++ Py3 bitmask速解Leetcode 762  Prime Number of Set Bits in Binary Representation

這段影片示範如何使用計數位元和位元遮罩(bit mask)，用幾行程式碼解決這個問題。

-----

this video shows how to use count bits & bitmask to solve this question in few lines. 

[codes on Leetcode]https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/solutions/7595294/c-bits-count-vs-pascal-trianglebeats-100-2r67/

Py3 C++迴圈與計數解Leetcode 696 Count Binary Substrings

Py3 C++迴圈與計數解Leetcode 696  Count Binary Substrings

Leetcode 696. Count Binary Substrings雖然標示為easy，也沒那麼trivial，花了一番功夫才解出branchless C++。而一般回圈解倒是不難，但須要思考一下

-----

Leetcode 696. Count Binary Substrings, though marked as easy, isn't exactly trivial; it took me some effort to solve it in branchless C++. Solving the general loop problem isn't difficult, but it needs thinking.

[codes on Leetcode]https://leetcode.com/problems/count-binary-substrings/solutions/7590515/cout-the-successive-1s-0sbeats-100-by-an-7amm/

Py3 C++使用 4 hashmaps解Leetcode 3714 Longest Balanced Substring II

 

 不喜歡C++的unordered_map，主要的原因是慢，也不想重新刻一個好的hashmap，不過透過memory_resource中的工具，加快三倍速度，也能寫出簡易的beats 99%C++解答

py3 C++巢狀迴圈解Leetcode難題3640 Trionic Array II

py3 CPP巢狀迴圈解Leetcode難題3640  Trionic Array II

使用巢狀迴圈來解決 LeetCode 上的難題，就用類似解決簡單的題目的方法。

Lettcode 3637. Trionic Array I簡單問題解了，困難的類似題3640. Trionic Array II也用類似方法解了。不要小看怎麼用迴圈

C++ Py3用nth_element, nsmallest解Leetcode 3010 Divide an Array Into Subar...

C++ Py3用nth_element, nsmallest解Leetcode 3010  Divide an Array Into Subarrays With Minimum Cost I

問題簡單，但應該是同類問題入門，先提供幾個簡易解答

[Py3一行解請進]

----

計數排序與greedy 2 pointer解Leetcode 1877 Minimize Maximum Pair Sum in Array

計數排序與greedy 2 pointer解Leetcode 1877  Minimize Maximum Pair Sum in Array 重點是理解為何Greedy方法可行，code很簡單，就排序sort, counting sort, radix sort都來一遍

[Py3 一行解請進]

C C++ Py3 DP與OOP解Leetcode 3573 Best Time to Buy and Sell Stock V

C C++ Py3  DP與OOP解Leetcode 3573  Best Time to Buy and Sell Stock V

[Py3 code請進]

py3 C C++階乘模運算速解Leetcode 3577 Count the Number of Computer Unlocking Pe...

py3 C C++階乘模運算速解Leetcode 3577  Count the Number of Computer Unlocking Permutations

[1-liner Py3請進]

Py3 C++利用Euclid公式達O(n)解Leetcode1925 Count Square Sum Triples

Py3 C++利用Euclid公式達O(n)解Leetcode 1925  Count Square Sum Triples

用數論方法解畢氏定理三角整數解個數，這應該算是Diophantine  Equation中最簡單的例題

[Py3解請進]