Skip to content

C++

LeetCode: 997-Find the Town Judge 解題紀錄

In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.

If the town judge exists, then:

1. The town judge trusts nobody.
2. Everybody (except for the town judge) trusts the town judge.
3. There is exactly one person that satisfies properties 1 and 2.

You are given an array trust where trust[i] = [ai, bi] representing that the person labeled ai trusts the person labeled bi.

Return the label of the town judge if the town judge exists and can be identified, or return -1 otherwise.
Read More »LeetCode: 997-Find the Town Judge 解題紀錄

LeetCode: 1010-Pairs of Songs With Total Durations Divisible by 60 解題紀錄

題目

You are given a list of songs where the ith song has a duration of time[i] seconds.

Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i, j such that i < j with (time[i] + time[j]) % 60 == 0.
Read More »LeetCode: 1010-Pairs of Songs With Total Durations Divisible by 60 解題紀錄

[C++] 二維或更高維的 std::vector 初始化筆記

在撰寫 C++ 的過程中，我們若是想要儲存一筆陣列資料，除了使用最基礎的 array 資料結構外，就是使用標準函式庫中的 vector 了。然而並不是所有的資料都是單純的一維資料，有時我們可能有著需求要建立二維甚至更高維的初始化資料；本篇文章就是紀錄該如何做到這件事的筆記。

Read More »[C++] 二維或更高維的 std::vector 初始化筆記