有一批订单记录,数据有订单号,入店时间,离店时间;
输入一个时间值A,需要在这批记录中找到符合入离店时间范围
(A大于等于入店时间,并且A小于等于离店时间)内的所有记录。 单次查询时间复杂度控制在O(logN)
※注意:订单号升序输出
输入描述:
记录数:10
时间值A:20180602
订单号 入店时间 离店时间
1001 20180103 20180105
1002 20180202 20180203
1003 20180304 20180306
1004 20180401 20180408
1005 20180501 20180504
1006 20180601 20180604
1007 20180705 20180706
1008 20180801 20180804
1009 20180903 20180903
1010 20181003 20181003
以上输入都为整型
输出描述:
1006
输入例子1:
10
20180602
1001 20180103 20180105
1002 20180202 20180203
1003 20180304 20180306
1004 20180401 20180408
1005 20180501 20180504
1006 20180601 20180604
1007 20180705 20180706
1008 20180801 20180804
1009 20180903 20180903
1010 20181003 20181003
输出例子1:
1006
输入例子2:
5
20170103
1013 20180103 20180105
1022 20180102 20180103
1103 20180104 20180106
1034 20180101 20180102
1105 20180201 20180204
输出例子2:
null
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
public class Main{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int timeA = Integer.parseInt(br.readLine());
//int count = 0;
ArrayList<Integer> list = new ArrayList<>();
for(int i = 0;i < n;i++){
String[] str = br.readLine().split(" ");
int orderid = Integer.parseInt(str[0]);
int intime = Integer.parseInt(str[1]);
int outtime = Integer.parseInt(str[2]);
if(timeA >= intime && timeA <= outtime){
list.add(orderid);
}
}
if(list.isEmpty())
System.out.println("null");
else{
Collections.sort(list);
for(Object obj:list)
System.out.println(obj);
}
}
}