[Qiskit] 量子位元狀態的表示法
Last Updated on 2022-12-19 by Clay
前一個章節我們使用 Qiskit 實作了一個半加法器（Half Adder）。現在，我們已經知道了什麼是『位元』（bits）、以及傳統電腦的部分工作原理。
Read More »[Qiskit] 量子位元狀態的表示法19 12 月, 2022
LeetCode: 1971-Find if Path Exists in Graph 解題紀錄
Last Updated on 2022-12-19 by Clay
題目
There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive). The edges in the graph are represented as a 2D integer array edges, where each edges[i] = [ui, vi] denotes a bi-directional edge between vertex ui and vertex vi. Every vertex pair is connected by at most one edge, and no vertex has an edge to itself.