LeetCode
LeetCode: 67-Add Binary 解題紀錄
題目
Given two binary stringsRead More »LeetCode: 67-Add Binary 解題紀錄a
andb
, return their sum as a binary string.
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 withRead More »LeetCode: 1094-Car Pooling 解題紀錄capacity
empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west). You are given the integercapacity
and an arraytrips
wheretrip[i] = [numPassengersi, fromi, toi]
indicates that theith
trip hasnumPassengersi
passengers and the locations to pick them up and drop them off arefromi
andtoi
respectively. The locations are given as the number of kilometers due east from the car's initial location. Returntrue
if it is possible to pick up and drop off all passengers for all the given trips, orfalse
otherwise.
LeetCode: 997-Find the Town Judge 解題紀錄
In a town, there areRead More »LeetCode: 997-Find the Town Judge 解題紀錄n
people labeled from1
ton
. 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 arraytrust
wheretrust[i] = [ai, bi]
representing that the person labeledai
trusts the person labeledbi
. Return the label of the town judge if the town judge exists and can be identified, or return-1
otherwise.
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 ofRead More »LeetCode: 1010-Pairs of Songs With Total Durations Divisible by 60 解題紀錄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 indicesi
,j
such thati < j
with(time[i] + time[j]) % 60 == 0
.
LeetCode: 938-Range Sum of BST 解題紀錄
題目
Given theRead More »LeetCode: 938-Range Sum of BST 解題紀錄root
node of a binary search tree and two integerslow
andhigh
, return the sum of values of all nodes with a value in the inclusive range[low, high]
.