标签归档：leetcode

题目描述：

LeetCode 792. Number of Matching Subsequences

Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S.

Example :
Input: 
S = "abcde"
words = ["a", "bb", "acd", "ace"]
Output: 3
Explanation: There ...

题目描述：

LeetCode 794. Valid Tic-Tac-Toe State

A Tic-Tac-Toe board is given as a string array board. Return True if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.

The board ...

LeetCode Weekly Contest 73是LeetCode举办的第七十七场正式周赛，共4道题目，比赛时长1.5小时。

比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-73/

题解列表：

LeetCode 788. Rotated Digits

LeetCode 789. Escape The Ghosts

LeetCode 791. Custom Sort String

LeetCode 790. Domino and Tromino Tiling

题目描述：

LeetCode 790. Domino and Tromino Tiling

We have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. These shapes may be rotated.

XX  <- domino

XX  <- "L" tromino
X

Given N, how many ways ...

题目描述：

LeetCode 791. Custom Sort String

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so ...