LeetCode

題目

You are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match.

題目

Given an integer array nums, return the number of all the arithmetic subsequences of nums.

題目

ou are given two strings s and t consisting of only lowercase English letters.

Return the minimum number of characters that need to be appended to the end of s so that t becomes a subsequence of s.

題目

Given a positive integer n, find the pivot integer x such that:

• The sum of all elements between 1 and x inclusively equals the sum of all elements between x and n inclusively.

題目

Given an m x n grid of characters board and a string word, return true if word exists in the grid.

… Read More »LeetCode: 36-Valid Sudoku 解題紀錄

題目

You are given an m x n matrix maze (0-indexed) with empty cells (represented as '.') and walls (represented as '+'). You are also given the entrance of the maze, where entrance = [entrancerow, entrancecol] denotes the row and column of the cell you are initially standing at.

… Read More »LeetCode: 223-Rectangle Area 解題紀錄

… Read More »LeetCode: 94-Binary Tree Inorder Traversal 解題紀錄

題目

You are given an integer array nums and an array queries where queries[i] = [vali, indexi].