_.min(array)
![[Functional Programming] Use a Javascript Array to Construct a Maybe](/scriptcss/images/72.png)
[Functional Programming] Use a Javascript Array to Construct a Maybe
Much of our code in real life is full of if statements that check the validity of a given input to see if a given computation should be performed. Using the ever popular Maybe construction allows us
日期 2023-06-12 10:48:40![[LeetCode] Find Minimum in Rotated Sorted Array](/scriptcss/images/71.png)
[LeetCode] Find Minimum in Rotated Sorted Array
LeetCode Find Minimum in Rotated Sorted Array II 假设按照升序排序的数组在预先未知的某个点上进行了旋转。 ( 例如，数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。 请找出其中最小的元素。 注意数组中可能存在重复的元素。 LeetCode 153. Find Minimum in Rotate
日期 2023-06-12 10:48:40
Programming: array
C int arr[5]; brackets must follow the identifier, definition of variable with array type needs an explicit size of an initializer
日期 2023-06-12 10:48:40[LeetCode] Find Minimum in Rotated Sorted Array
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4
日期 2023-06-12 10:48:40![[LeetCode] 945. Minimum Increment to Make Array Unique 使数组没有重复数字的最小增量](/scriptcss/images/74.png)
[LeetCode] 945. Minimum Increment to Make Array Unique 使数组没有重复数字的最小增量
Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1. Return the least number of moves to make every value in A unique. Example
日期 2023-06-12 10:48:40办公协同：xmind8案例实战班-Array老师-专题视频课程
办公协同：xmind8案例实战班—536人已学习 课程介绍 本视频教程，弥补了xmind8思维导图官网无视频教程的空缺，是唯一一部严格按照官网的教学顺序+实战的方式打造的适合国内教程。无论是你程序员还是普通hr，行政，亦或者其他......但是当你
日期 2023-06-12 10:48:40154. Find Minimum in Rotated Sorted Array II
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Find the minimum element. The a
日期 2023-06-12 10:48:40E - Minimal Subarray Length（连续区间和）
题目链接 题意：给出n个数，求加和大于x的最短区间的区间长度。 如果前i个数字和为y，那么如果前j数字的和小于等于y-x，那么i-j就是一种可能的情况，我们对于所有的i找出前面最大的j就可以了，因为数据量比较大，用树状数组来处理前n项的最大值，但是每个数字又可能比较大，所以先离散化处理一下。 AC代码 1 #include<cstdio> 2 #in
日期 2023-06-12 10:48:40