[题目描述] Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? Notice:If landing and flying happens at the same time, we consider landing should happen at first. 给出飞机的起飞和降落时间的列表,用 interval 序列…

Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? Notice If landing and flying happens at the same time, we consider landing should happen at first. Example For interval list [ [1,10],…

C++ (1)把interval数组中的所有start和所有end放在同一个数组中,然后进行排序,遇到start就起飞一架飞机,遇到一架end就降落一架飞机,所以start有个+1属性,end有个-1属性,这样就可以根据排序之后的数组得知任意时间飞行中的飞机的数量了 (2)pair,make_pair,val.first,val.second (3)sort(), max() (4)for (auto &i : Object) {} (5)push_back() /** * Definition…

[题目描述] Give you an integer array (index from 0 to n-1, where n is the size of this array, data value from 0 to 10000) . For each element Ai in the array, count the number of element before this element Ai is smaller than it and return count number ar…

[题目描述] Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you an integer, return the number of element in the array that are smaller than the given integer…

[题目描述] Find the kth smallest number in at row and column sorted matrix. 在一个排序矩阵中找从小到大的第 k 个整数. 排序矩阵的定义为:每一行递增,每一列也递增. [题目链接] www.lintcode.com/en/problem/kth-smallest-number-in-sorted-matrix/ [题目解析] 寻找第k小的数,可以联想到转化为数组后排序,不过这样的时间复杂度较高:O(n^2 log n^2) +…

[题目描述] Given an array of n integer, and a moving window(size k), move the window at each iteration from the start of the array, find the median of the element inside the window at each moving. (If there are even numbers in the array, return the N/2-t…

[题目描述] For an array, we can build a Segment Tree for it, each node stores an extra attribute count to denote the number of elements in the the array which value is between interval start and end. (The array may not fully filled by elements) Design a…

[题目描述] Partition an integers array into odd number first and even number second. 分割一个整数数组,使得奇数在前偶数在后. [题目链接] www.lintcode.com/en/problem/partition-array-by-odd-and-even/ [题目解析] 1.将数组中的奇数和偶数分开,使用『两根指针』的方法,用快排的思路,右指针分别从数组首尾走起 2.左指针不断往右走直到遇到偶数,右指针不断往左走直…

Content 有一个长度为 \(n\) 的数组,请求出使得 \(a_i \oplus a_j=x\) 且 \(i\neq j\) 的数对 \((i,j)\) 的个数.其中 \(\oplus\) 表示异或符号. 数据范围:\(1\leqslant n,a_i\leqslant 10^5,0\leqslant x\leqslant 10^5\). Solution 利用一个异或的性质:\(a\oplus b=c\Rightarrow a\oplus c=b,b\oplus c=a\),我们发现问题…