896. 單調(diào)數(shù)列

https://leetcode-cn.com/contest/weekly-contest-100/problems/monotonic-array/

package com.test;/*** @author stono* @date 2018/9/2*/ public class Lesson896 {public static void main(String[] args) {int[] A = {1,2,2,3};boolean monotonic = isMonotonic(A);System.out.println(monotonic);}public static boolean isMonotonic(int[] A) {if (A.length == 0) {return true;}boolean less = true;boolean bigger = true;boolean equal = true;for(int i=0;i<A.length-1;i++) {less = less && ( A[i] <= A[i + 1]) ;bigger = bigger && ( A[i] >= A[i + 1]);equal = equal && ( A[i] - A[i + 1]==0);}if (less || bigger || equal) {return true;}return false;} }

?

與50位技術(shù)專家面對面20年技術(shù)見證，附贈技術(shù)全景圖

總結(jié)

以上是生活随笔為你收集整理的896. 单调数列的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。