Given a sorted array of integers, find the starting and ending position of a given target value.

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

Say you have an array for which the ith element is the price of a given stock on day i.

Say you have an array for which the ith element is the price of a given stock on day i.

原题地址：https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

自从引入 Transformer 以来，其在 NLP 任务中就已被证明拥有卓越的性能。计算机视觉也不例外，近些年，Transformer 的使用在计算机视觉领域也变得非常流行。例如，Carian et al. 的 DETR 目标检测网络提出利用稀疏查询（sparse...

当优化问题的目标函数为两个或两个以上时，该优化问题就是多目标优化。不同于单目标优化问题，多目标问题没有单独的解能够同时优化所有目标，也就是目标函数之间存在着冲突关系，其最优解通常是一系列解。多目标优化问题的解...

Say you have an array for which the ith element is the price of a given stock on day i.