## 题目描述：

LeetCode 1015. Numbers With Repeated Digits

Given a positive integer `N`, return the number of positive integers less than or equal to `N` that have at least 1 repeated digit.

Example 1:

```Input: 20
Output: 1
Explanation: The only ...```

## 题目描述：

LeetCode 950. Reveal Cards In Increasing Order

In a deck of cards, every card has a unique integer.  You can order the deck in any order you want.

Initially, all the cards start face down (unrevealed) in one deck ...

## 题目描述：

LeetCode 952. Largest Component Size by Common Factor

Given a non-empty array of unique positive integers `A`, consider the following graph:

• There are `A.length` nodes, labelled `A` to `A[A.length - 1];`
• There is an edge between `A ...`

## Java8 Stream 计算数组最大值、最小值 作者是 在线疯狂 发布于 2018年9月16日 在 Java.

Arrays.stream(A).max().getAsInt()

``````int[] A = {6,7,8,2,1,3,4,5};
int maxVal = Arrays.stream(A).max().getAsInt();
``````

Arrays.stream(A).min().getAsInt()

``int[] A = {6,7,8,2,1,3,4 ...``

## 题目描述：

LeetCode 873. Length of Longest Fibonacci Subsequence

A sequence `X_1, X_2, ..., X_n` is fibonacci-like if:

• `n >= 3`
• `X_i + X_{i+1} = X_{i+2}` for all `i + 2 <= n`

Given a strictly increasing array `A` of positive ...