2017年8月27日
665. Non-decreasing Array 非递减数组
摘要： Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.We define an array is non-decreasing if array[i] nums[i + 1] and nums[i] < nums[... 阅读全文
posted @ 2017-08-27 22:48 xiejunzhao 阅读(1275) 评论(0) 推荐(0)