LeetCode: 150-Evaluate Reverse Polish Notation 解題紀錄
題目
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Read More »LeetCode: 150-Evaluate Reverse Polish Notation 解題紀錄Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Read More »LeetCode: 150-Evaluate Reverse Polish Notation 解題紀錄隨著時代的進步,現在人們已經可以在舒適的家裡進行量子電腦的程式設計了。但是話說回來,我們究竟要創造什麼呢?什麼是量子程式設計呢?說到底,什麼又是量子電腦呢?
Read More »[Qiskit] 使用量子電路實作半加法器(Half Adder)You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Read More »LeetCode: 198-House Robber 解題紀錄Given an n x n
array of integers matrix
, return the minimum sum of any falling path through matrix
.
You are climbing a staircase. It takes n
steps to reach the top.
Each time you can either climb 1
or 2
steps. In how many distinct ways can you climb to the top?
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.
Read More »LeetCode: 124-Binary Tree Maximum Path Sum 解題紀錄本文僅翻譯、整理官方文檔關於此章節的內容,不會有太多專業的敘述,僅僅是個開場白的介紹;更詳細的 Textbook 翻譯可以參考本文文末的 Read More 連結。
Read More »[Qiskit] 量子計算(Quantum Computing)基本介紹 - IntroductionGiven the root
of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is maximized.
Given the root
of a binary tree, find the maximum value v
for which there exist different nodes a
and b
where v = |a.val - b.val|
and a
is an ancestor of b
.
『量子物理學』(quantum physics)是一個廣泛應用但鮮為人知的術語。簡單來說,量子物理學是一個描述微觀世界中粒子如何運動的數學模型。
Read More »[Qiskit] 什麼是量子(Quantum)?