Skip to content

C++

LeetCode: 167-Two Sum II - Input Array Is Sorted 解題紀錄

題目

Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.

Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.

The tests are generated such that there is exactly one solution. You may not use the same element twice.
Read More »LeetCode: 167-Two Sum II - Input Array Is Sorted 解題紀錄

LeetCode: 1094-Car Pooling 解題紀錄

題目

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

You are given the integer capacity and an array trips where trip[i] = [numPassengersi, fromi, toi] indicates that the ith trip has numPassengersi passengers and the locations to pick them up and drop them off are fromi and toi respectively. The locations are given as the number of kilometers due east from the car's initial location.

Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise.
Read More »LeetCode: 1094-Car Pooling 解題紀錄

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 初始化筆記