Amazon Campus(2013-Sep-22)Question 1 / 2 (Amazon Campus(5): completely inside interval)
2013-09-22 12:56
351 查看
Question 1 / 2 (Amazon Campus(5): completely inside interval)
Given a set of open intervals, check whether there exists an interval which is completely inside another interval. If exists, print “1”, otherwise print “0”. You just need to consider the case that all the end points are integers and there are no exactly
the same open intervals.
Input:
n --- number of open intervals
a_1 b_1 a_2 b_2 ... a_n b_n ------ n open intervals (a_1, b_1) ... (a_n, b_n), in which a_i < b_i for all i
Output:
1 (meaning that there exists an interval which is completely inside another interval) or 0 (otherwise)
Sample Input 1
3
1 2 3 4 5 6
Sample Output 1
0
Sample Input 2
2
1 4 2 3
Sample Output 2
1
注意:等于的情况也算全部包含。
Given a set of open intervals, check whether there exists an interval which is completely inside another interval. If exists, print “1”, otherwise print “0”. You just need to consider the case that all the end points are integers and there are no exactly
the same open intervals.
Input:
n --- number of open intervals
a_1 b_1 a_2 b_2 ... a_n b_n ------ n open intervals (a_1, b_1) ... (a_n, b_n), in which a_i < b_i for all i
Output:
1 (meaning that there exists an interval which is completely inside another interval) or 0 (otherwise)
Sample Input 1
3
1 2 3 4 5 6
Sample Output 1
0
Sample Input 2
2
1 4 2 3
Sample Output 2
1
static int interval(int[] a) { // a : storing all the end points, in the same order as the input, that is, a_1 b_1 a_2 b_2 ... a_n b_n // return value: 1 (meaning that there exists an interval which is completely inside another interval) or 0 (otherwise) int flag = 0; for(int i=0; i<a.length-1; i+=2) { for(int j=0; j!=i&&j<a.length-1; j+=2) { if((a[i]<=a[j] && a[i+1]>=a[j+1]) || (a[j]<=a[i] && a[j+1]>=a[i+1])) { flag = 1; break; } } } return flag; }
注意:等于的情况也算全部包含。
相关文章推荐
- Amazon Campus(2013-Sep-22)Question 2 / 2 (Amazon Campus(9): MM-Chess)
- Amazon Campus(2013-Sep-24)Question 1 / 2 (Amazon Campus(15): Clock wise walk)
- Amazon Campus(2013-Sep-24)Question 2 / 2 (Amazon Campus(17):Find the differences of items in amazon)
- Amazon Hiring Campus 2013 - Final 6
- 1Z0-51 QUESTION 22 INTERVAL的使用
- Amazon Hiring Campus 2013
- 2013_09_22 固定div setTimeout
- 2013amazon网上测试题
- OCP 1Z0 051 QUESTION NO: 22
- Linux环境启动,端口被占用22-Sep-2017 13:50:04.690 WARNING [localhost-startStop-2] org.apache.catalina.loader.W
- Amazon Interview Question: Design an OO parking lot
- 转载String分析 (http://www.cnblogs.com/fancydeepin/archive/2013/04/22/min-snail-speak_String.html)
- amazon 2013校园招聘题目
- JS中国时间转化为标准时间 Thu Aug 22 2013 15:12:00 GMT+0800
- 2018_1_22_poj_2013_重新排序
- 2013=7=22
- CIKM 2013 Paper CQARank: Jointly Model Topics and Expertise in Community Question Answering
- 2013/12/22 星期日: 第四讲
- [知其然不知其所以然-22] What's inside the pm_trace
- CIKM 2013 Paper CQARank: Jointly Model Topics and Expertise in Community Question Answering