花花酱 LeetCode 896. Monotonic Array

zxi — Sun, 02 Sep 2018 05:31:07 +0000

An array is monotonic if it is either monotone increasing or monotone decreasing.

An array A is monotone increasing if for all i <= j, A[i] <= A[j]. An array A is monotone decreasing if for all i <= j, A[i] >= A[j].

Return true if and only if the given array A is monotonic.

Solution:

C++

// Author: Huahua
class Solution {
public:
  bool isMonotonic(vector& A) {
    bool inc = true;
    bool dec = true;
    
    for (int i = 1; i < A.size(); ++i) {
      inc &= A[i] >= A[i - 1];
      dec &= A[i] <= A[i - 1];
    }
    
    return inc || dec;
  }
};

Java

class Solution {
  public boolean isMonotonic(int[] A) {
    boolean inc = true;
    boolean dec = true;
    
    for (int i = 1; i < A.length; ++i) {
      inc &= A[i] >= A[i - 1];
      dec &= A[i] <= A[i - 1];
    }
    
    return inc || dec;
  }
}

Python

# Author: Huahua
class Solution:
  def isMonotonic(self, A):    
    inc = True;
    dec = True;
    
    for i in range(1, len(A)):
      inc = inc and A[i] >= A[i - 1]
      dec = dec and A[i] <= A[i - 1]    
    
    return inc or dec;

The post 花花酱 LeetCode 896. Monotonic Array appeared first on Huahua's Tech Road.

incresing Archives - Huahua's Tech Road

花花酱 LeetCode 896. Monotonic Array

Solution:

C++

Java

Python