diff options
| author | crupest <crupest@outlook.com> | 2021-02-28 17:52:47 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-28 17:52:47 +0800 |
| commit | 4e9dc28268aae2ff7f6da75437350cc91ba87b0f (patch) | |
| tree | ca78742be8d1debe16b437077b0c87ac11400de9 | |
| parent | faac6dd383fc43ae6a43309fa78d23acd05601f4 (diff) | |
| download | solutions-4e9dc28268aae2ff7f6da75437350cc91ba87b0f.tar.gz solutions-4e9dc28268aae2ff7f6da75437350cc91ba87b0f.tar.bz2 solutions-4e9dc28268aae2ff7f6da75437350cc91ba87b0f.zip | |
Add problem 896.
| -rw-r--r-- | leetcode/cpp/896.cpp | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/leetcode/cpp/896.cpp b/leetcode/cpp/896.cpp new file mode 100644 index 0000000..25bd528 --- /dev/null +++ b/leetcode/cpp/896.cpp @@ -0,0 +1,35 @@ +#include <vector>
+
+using std::vector;
+
+enum Order { Ascend, Descend, Unknown };
+
+class Solution {
+public:
+ bool isMonotonic(vector<int> &A) {
+ Order order = Unknown;
+
+ int count = A.size();
+ for (int i = 1; i < count; i++) {
+ int last = A[i - 1];
+ int current = A[i];
+ if (order == Unknown) {
+ if (current > last) {
+ order = Ascend;
+ } else if (current < last) {
+ order = Descend;
+ }
+ } else if (order == Ascend) {
+ if (last > current) {
+ return false;
+ }
+ } else {
+ if (last < current) {
+ return false;
+ }
+ }
+ }
+
+ return true;
+ }
+};
|