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

원문링크 : JAVA_Monotonic Array_LeetCode 896

 등록된 다른 글

JSP 내장 객체 4 - page / exception

SQL(ORACLE 기준) - Join((비)등가 Join, 셀프 Join)

SQL 문제 29 - 우유와 요거트가 담긴 장바구니(프로그래머스)

JAVA_Remove Duplicates from Sorted List_LeetCode 83

JAVA_Robot Return to Origin_LeetCode 657