题目描述:
LeetCode 393. UTF-8 Validation
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
- For ...
LeetCode 393. UTF-8 Validation
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
Given a string s and a string t, check if s is subsequence of t.
You may assume that there is only lower case English letters in both s and t. t is potentially a ...
LeetCode 114. Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / \ 2 5 / \ \ 3 4 6
The flattened tree should look like:
1 \ 2 \ 3 \ 4 \ 5 ...
LeetCode Weekly Contest 2是LeetCode举办的第一场正式周赛,共3道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-2/
题解列表:
LeetCode 389. Find the Difference
LeetCode 391. Perfect Rectangle
Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region.
Each rectangle is represented as a bottom-left point and a top-right point. For example ...