C++ 實作 Eratosthenes 篩法：百萬內質數一網打盡

LeetCode 3629 | Prime Teleportation | Fast BFS + Sieve (Beats 100%)

Sieve BFS解Leetcode 3629  Minimum Jumps to Reach End via Prime Teleportation

目前記錄為83ms. Using array version of linked lists it 's faster, say 64ms!為何結合Sieve法與BFS的問題。會被Leetcode標示為medium?

幾個100%的解

[codes on Leetcode]https://leetcode.com/problems/minimum-jumps-to-reach-end-via-prime-teleportation/solutions/8164753/sieve-of-eratosthenes-bfs-no-hash83ms-be-f6ci/

黑柴心很累💢 擋路的是#虎式坦克，AI 竟然不認識？🤖 #Shorts #YOLO

Master LeetCode 1861 | Efficient Loop Strategy for Rotating the Box | Beats 100%

C++ C Py3 loop速解Leetcode 1861  Rotating the Box

一連數日Leetcode都是"rotate"的問題，這些問題都解完了嗎?先解今天的