C++

… Read More »LeetCode: 1572-Matrix Diagonal Sum 解題紀錄

題目

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

• answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
• answer[1] is a list of all distinct integers in nums2 which are not present in nums1.

題目

There is a function signFunc(x) that returns:

… Read More »LeetCode: 319-Bulb Switcher 解題紀錄

題目

You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].

Implement the SmallestInfiniteSet class:

題目

You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.

題目

There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.

題目

Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise.

題目

ou are given a string s, which contains stars *.

In one operation, you can:

題目

There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.