[LeetCode][Python3] 665. Non-decreasing Array

snoopybox 2018. 9. 13. 01:47

Problem :

https://leetcode.com/problems/non-decreasing-array/description/

My Solution :

class Solution:
    def checkPossibility(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        i = 0
        j = len(nums)-1
        while i < j:
            if nums[i] > nums[i+1]:
                break
            i += 1
        while i < j:
            if nums[j] < nums[j-1]:
                break
            j -= 1
        if j - i > 1:
            return False
        if 0 < i and j < len(nums)-1:
            if nums[i-1] > nums[j] and nums[i] > nums[j+1]):
                return False
        return True

Comment :

진짜 어렵게 풀었다. 제출을 무려 9번이나 하고 통과했네 ㅠㅠ