solves non decreasing array

Author: anishLearnsToCode

Diff for: README.md

@@ -171,7 +171,7 @@
 | 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [![Java](assets/java.png)](src/TwoSumIVInputIsABST.java) [![Python](assets/python.png)](python/two_sum_iv.py) |
 | 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [![Java](assets/java.png)](src/RobotReturnToOrigin.java) [![Python](assets/python.png)](python/robot_return_to_origin.py) |
 | 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | [![Java](assets/java.png)](src/ImageSmoother.java) [![Python](assets/python.png)](python/image_smoother.py) |
-| 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | |
+| 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | [![Java](assets/java.png)](src/NonDecreasingArray.java) [![Python](assets/python.png)](python/non_decreasing_array.py) |
 | 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | |
 | 671 | [Second Minimum Node in Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | |
 | 674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | |

Diff for: python/non_decreasing_array.py

@@ -0,0 +1,13 @@
+from typing import List
+
+
+class Solution:
+    def checkPossibility(self, nums: List[int]) -> bool:
+        handled_decreasing = False
+        for index in range(len(nums) - 1):
+            if nums[index] > nums[index + 1]:
+                if handled_decreasing: return False
+                handled_decreasing = True
+                if index - 1 >= 0 and nums[index - 1] > nums[index + 1] and index + 2 < len(nums) and nums[index] > nums[index + 2]:
+                    return False
+        return True

Diff for: src/NonDecreasingArray.java

@@ -0,0 +1,15 @@
+public class NonDecreasingArray {
+    public boolean checkPossibility(int[] array) {
+        boolean handledDecreasing = false;
+        for (int index = 0 ; index < array.length - 1 ; index++) {
+            if (array[index] > array[index + 1]) {
+                if (handledDecreasing) return false;
+                handledDecreasing = true;
+                if ((index - 1 >= 0 && array[index - 1] > array[index + 1]) && (index + 2 < array.length && array[index] > array[index + 2])) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+}