로딩
요청 처리 중입니다...

JAVA_Monotonic Array_LeetCode 896

 JAVA_Monotonic Array_LeetCode 896

JAVA_Monotonic Array_LeetCode 896 풀이 class Solution { public boolean isMonotonic(int[] nums) { boolean asc = false, desc = false; for(int i = 1; i < nums.length; i++){ if(nums[i] < nums[i-1]) desc = true; if(nums[i] > nums[i-1]) asc = true; } return asc && desc ? false: true; } } * 출처 Monotonic Array - LeetCode Can you solve this real interview question?

Monotonic Array - An array is monotonic if it is either monotone increasing or monotone decreasing. An array nums is monotone increasing if for...

# JAVA # JAVA_LeetCode896 # JAVA_MonotonicArray # JAVA_MonotonicArray_LeetCode896 # MonotonicArray_LeetCode896