Leetcode之Non-decreasing Array 问题

问题描述：

Given an array with n integers, your task is to check if it could become non-decreasing bymodifying at most 1 element.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for everyi (1 <= i < n).

Note: The n belongs to [1, 10,000].

示例一：

Input: [4,2,3]
Output: True
Explanation: You could modify the first 4 to1 to get a non-decreasing array.

示例二：

Input: [4,2,1]
Output: False
Explanation: You can't get a non-decreasing array by modify at most one element.

问题来源：