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,jsuch thati < jwith(time[i] + time[j]) % 60 == 0.
在撰寫 C++ 的過程中，我們若是想要儲存一筆陣列資料，除了使用最基礎的 array 資料結構外，就是使用標準函式庫中的 vector 了。然而並不是所有的資料都是單純的一維資料，有時我們可能有著需求要建立二維甚至更高維的初始化資料；本篇文章就是紀錄該如何做到這件事的筆記。
Read More »[C++] 二維或更高維的 std::vector 初始化筆記Given theRead More »LeetCode: 938-Range Sum of BST 解題紀錄rootnode of a binary search tree and two integerslowandhigh, return the sum of values of all nodes with a value in the inclusive range[low, high].
The power of the string is the maximum length of a non-empty substring that contains only one unique character. Given a string s, return the power of s.Read More »LeetCode: 1446-Consecutive Characters
Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary representation of a number.
Return the decimal value of the number in the linked list.The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two integers x and y, return the Hamming distance between them.Read More »LeetCode: 461-Hamming Distance 解題紀錄
Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.)