类别归档：LeetCode

LeetCode OJ is a platform for preparing technical coding interviews.

题目描述：

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist ...

题目描述：

Given a non-zero positive integer, return its corresponding column title as appear in an Excel sheet.

For example:

```    1 -> A
2 -> B
3 -> C
...
26 -> Z
27 -> AA
28 -> AB ```

题目描述：

Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.

If the fractional part is repeating, enclose the repeating part in parentheses.

For example,

• Given numerator = 1, denominator = 2, return "0.5" ...

题目描述：

Compare two version numbers version1 and version2.
If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.

You may assume that the version strings are non-empty and contain only digits and the . character.
The ...

题目描述：

Given an unsorted array, find the maximum difference between the successive elements in its sorted form.

Try to solve it in linear time/space.

Return 0 if the array contains less than 2 elements.

You may assume all elements ...