Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.
Given a non-empty string , you may delete at most one character. Judge whether you can make it a palindrome.
There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
Do you like me?
「LeetCode刷题（Easy Rank）：937. Reorder Log Files」
155 • 0 • 3月前
「LeetCode刷题（Easy Rank）：929. Unique Email Addresses」
45 • 0 • 3月前
「LeetCode刷题（Easy Rank）：859. Buddy Strings」
32 • 0 • 3月前
「LeetCode刷题（Easy Rank）：824. Goat Latin」
「LeetCode刷题（Easy Rank）：819. Most Common Word」
29 • 0 • 3月前