link 本题是一道 弱化条件 的经典模型。（普通的数 -> \(0/1\)） \(\mathcal{Idea\ 1}\) 这个值域似乎有点太大了，所以我们暂且选择一个临界点，将其看作一个 \(01\) 序列。（比它大就赋为 \(1\)，比它小就赋为 \(0\)） 发现如果原排列最后能递减，那么这个 \(01\) 序列最后肯定是 \(111...000...
My solution: class Solution { public boolean isMonotonic(int[] nums) { if(nums==null||nums.length<3){ return true; } int first = nums[0]; int second = nums[nums.length-1]; if(first<second){
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black sec
这里主要是跟时钟相关的一些函数，其实不是特别需要仔细阅读。 #include "monotonic.h" #include <stddef.h> #include <stdlib.h> #include <stdio.h> #include <time.h> #undef NDEBUG #include <assert.h> /* The function pointer for clock retrieval. */
239. Sliding Window Maximum Hard You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding win
题意:给出一个长度为\(n\)的序列\(a\),根据\(a\)构造一个序列\(b\),要求: 1.\(b_{1}=0\) 2.对于\(i,j(i\le i,j \le n)\),若\(a_{i}=a_{j}\),则\(b_{i}=b_{j}\) 3.对于\(i\in [1,n-1]\),有\(b_{i+1}=b_{i}\)或\(b_{i+1}=b_{i}+1\) 求有多少可能的\(
问题： 给定数组，判断若为单调增（A[i]>=A[i-1]）或者单调减（A[i]<=A[i-1]）数组，则返回true，否则返回false。 Example 1: Input: [1,2,2,3] Output: true Example 2: Input: [6,5,4,4] Output: true Example 3: Input: [1,3,2] Output: false Example 4: Input: [1,2,4,5] Output: true
定理（Lindström–Gessel–Viennot lemma）很简单： 学的时候忘了大的行列式怎么算的了。。 然后就可以写题了： 第一道：CodeForces-348D（链接https://vjudge.net/problem/CodeForces-348D） 题意给你个n*m的方阵，有一些点无法通过，然后求从(1,1)到(n,m)走两条路，并且两条路不相交的方
安装 libevent 出错: event.c error: 'CLOCK_MONOTONIC' undeclaredchecking build system type... configure: error: cannot guess build type; you must specify one--build=arm-linux在编译 libevent-1.2 源码时, make 出错:event.c:157:20: error: 'CLOCK_MONOTONIC&#
Sliding Window Maximum Shortest Unsorted Continuous Subarray Next Greater Element I 503.Next Greater Element II Largest Rectangle in Histogram Best Time to Buy and Sell Stock II Shortest Subarray with Sum at Least K
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
