百度硅谷OA

Baidu硅谷 OA
两个题，一共一个小时
1. C++一些基本问题， 用一句话解释专业名词比如polymorphism
2. Coding题

Implement a Calendar class which supports two operations:

1.  Schedule events  
2.  Find time windows which are overbooked and find the associated
    conflicted events.

Please implement Schedule and FindConflictedTimeWindows. The return
value of FindConflictedTimeWindows should be a list of
ConflictedTimeWindow objects ordered by their start_time from earliest
to latest. Please be aware that each ConflictedTimeWindow should contain
ALL the conflicted events within the associated time period.


Calendar calendar = Calendar()
calendar.Schedule(new Event(4, "2014-01-02 10:00", "2014-01-02 11:00"))
calendar.Schedule(new Event(5, "2014-01-02 09:30", "2014-01-02 11:30"))
calendar.Schedule(new Event(6, "2014-01-02 08:30", "2014-01-02 12:30"))

calendar.FindConflictedTimeWindows()
// should return something like the following
// [ConflictedTimeWindow("2014-01-02 09:30", "2014-01-02 10:00", { 5, 6 }),
//  ConflictedTimeWindow("2014-01-02 10:00", "2014-01-02 11:00", { 4, 5, 6 }),
//  ConflictedTimeWindow("2014-01-02 11:00", "2014-01-02 11:30", { 5, 6 }),
~~~~

想问问楼主这题怎么做的   能不能说说思路？

Zek_W 发表于 2016-4-9 03:19
想问问楼主这题怎么做的   能不能说说思路？

自己猜的是给时间排序，
和skyline不同的是不用维护一个最大的值，
用set储存event的名字就行了，size>1的时候就是有冲突，然后遍历一遍输出结果就行了。

我猜的。。。。。反正我不会用c++23333333

数据数据数据 发表于 2016-4-17 19:24
自己猜的是给时间排序，
和skyline不同的是不用维护一个最大的值，
用set储存event的名字就行了，size> ...

没事   早就考完已跪了~~