## 题目

In a list of songs, the i-th song has a duration of time[i] seconds.

Return the number of pairs of songs for which their total duration in seconds is divisible by 60. Formally, we want the number of indices i < j with (time[i] + time[j]) % 60 == 0.

- 查看完整题目和思路 -

## 题目

For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [1,2,3,1].

Given the array-form A of a non-negative integer X, return the array-form of the integer X+K.

- 查看完整题目和思路 -

## 题目

Given an array A of integers, return true if and only if it is a valid mountain array.

Recall that A is a mountain array if and only if:

``A.length >= 3``

There exists some i with `0 < i < A.length - 1` such that:

``````A < A < ... A[i-1] < A[i]
A[i] > A[i+1] > ... > A[A.length - 1]``````

- 查看完整题目和思路 -

## [todo] 914. X of a Kind in a Deck of Cards

In a deck of cards, each card has an integer written on it.

Return true if and only if you can choose X >= 2 such that it is possible to split the entire deck into 1 or more groups of cards, where:

Each group has exactly X cards.
All the cards in each group have the same integer.

- 查看完整题目和思路 -

## 题目

An array is monotonic if it is either monotone increasing or monotone decreasing.

An array A is monotone increasing if for all i <= j, A[i] <= A[j]. An array A is monotone decreasing if for all i <= j, A[i] >= A[j].

Return true if and only if the given array A is monotonic.

- 查看完整题目和思路 -