You have a list of words and a pattern, and you want to know which words in words matches the pattern.

The binary search tree is guaranteed to have unique values. #### 1. 例子

We are given an array A of N lowercase letter strings, all of the same length.

A.length >= 3There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]Given an array that is definitely a mountain, return any i such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.leng...

A self-dividing number is a number that is divisible by every digit it contains.

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

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.

1.题目：Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.

1. 题目Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.示例一：

1.题目：In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.

1.题目International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.

1.题目Every email consists of a local name and a domain name, separated by the @ sign.