[Qiskit] 量子位元狀態的表示法

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.

Last Updated on 2022-12-18 by Clay

題目

Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.

Last Updated on 2022-12-17 by Clay

題目

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Last Updated on 2022-12-14 by Clay

題目

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.

Last Updated on 2022-12-13 by Clay

題目

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

Last Updated on 2022-12-12 by Clay

題目

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?

Last Updated on 2022-12-11 by Clay

題目

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.