divcode1986
BAN USER
- 0
RepOffers ammunition for sale form top brands
- 0
Repjoyceeallard, Associate at Adap.tv
Hi, i am working as a training manager as a business professional who assesses the growth and development needs of ...
- 0
Repsharonpkarr, None at BT
Hi! My name is Mary. I am a writer for a variety of web and multi-platform applications.I am a ...
- 10
RepNatalieLutz, Applications Developer at Absolute Softech Ltd
Pitch trending story topics and continually look for ways to push breaking and/or viral stories forward with new angles ...
- 0
Repallisonepollard, Applications Developer at Accenture
I am Allison from Germantown. I work as a Staff manager at The LawnGuru company. But my interest in blogging ...
- 0
Repmelodyakeel, Consultant at Progress
Hello I am Melody. I am working as Human resource clerks, also called human resource assistants. I can maintain employee ...
- 0
RepDonnaWHale, Data Engineer at ADP
Hi, I am passionate writer with a BA in English from the Ohio State University.5+ years of experience writing ...
- 0
Repnancysimms14, Backend Developer at ASAPInfosystemsPvtLtd
I am Nancy from California,Handling project development and documentation is my job. Passionate determined.Looking for an open project ...
- 0
Repabbyhgabb, Associate at Abs india pvt. ltd.
Develop fresh content for emails, web banners, site wide communication, and subject lines.Write stories, blogs and related content about ...
- 0
Repcrystalblibby, Analyst at Achieve Internet
By professional i am teacher. Successfully supervised and assisted students, grade artwork, encouraged creativity and new technique.Familiar with art ...
- 0
Rep
- 0
Rep
Open Chat in New Window
- divcode1986 May 17, 2016/* Assumptions: Conference room data is provided as a list of sorted disjoint interval objects. Meeting time of interest (m) is an interval object. Brute-force: Iterate through each list of interval objects representing conference rooms. For each list, do a linear search for the presence of an interval that overalps with (m). Time complexity: O(nm) where n is the number of conference rooms and m is the size of the longest list of disjoint intervals. Better appraoach: Same as brute force but instead of linear search use binary search. Time complexity: O(nlogm)**/ public class Interval { int start; int end; } public int countOpenings(ArrayList<ArrayList<Interval>> ls, Interval m) { if(ls==null||ls.isEmpty()||m==null) { return 0; } int c=0; for(int i=0;i<ls.size();i++) { if(isAvailable(ls.get(i),m)) { c++; } } return c; } private boolean isAvailable(ArrayList<Interval> ls, Interval n) { int start=0; int end=ls.size()-1; while(start<=end) { int mid=(start+end)/2; if(isOverlap(ls.get(mid),n)) { return false; } if(ls.get(mid).end<=n.start) { start=mid+1; }else { end=mid-1; } } return true; } private boolean isOverlap(Interval m, Interval n) { return(m.start>=n.start && m.start<n.end)||(n.start>=m.start && n.start<m.end); }