有两个序列A和B,A=(a1,a2,...,ak),B=(b1,b2,...,bk),A和B都按升序排列。对于1<=i,j<=k,求k个最小的(ai+bj)。要求算法尽量高效。
int *min_k(int *A, int *B, int len1, int len2, int k) {
if (A == N...
/*Oracle数据库查询日期在两者之间*/
SELECT
DISTINCT ATA
FROM
LM_FAULT
WHERE
(
OCCUR_DATE BETWEEN to_date( '2017-05-01', 'yyyy-MM-DD' ) AND to_date( '2017-05-15', 'yyyy-MM-DD' )
...