gnaresh19 / problemsolving Goto Github PK

int[] resultArray = getProductArray(numbers);

System.out.println(Arrays.toString(resultArray));

if(numbers.length<1){
  System.out.println("No numbers found!");
  return null;
}

int[] result = new int[numbers.length];
result[0] = numbers[0];

int product = 1;
for(int i=0;i<numbers.length;i++){
  result[i] = product;
  product *= numbers[i];
  
}

product = 1;
for(int i=numbers.length-1;i>=0;i--){
  result[i] *= product;
  product *= numbers[i]; 
}

return result;

public Meeting(int startTime, int endTime){
  this.startTime = startTime;
  this.endTime = endTime;
}

public int getStartTime() {
    return startTime;
}

public void setStartTime(int startTime) {
    this.startTime = startTime;
}

public int getEndTime() {
    return endTime;
}

public void setEndTime(int endTime) {
    this.endTime = endTime;
}

public String toString(){
   return "[" + startTime + "," + endTime + "]"; 
}

List<Meeting> meetings = new ArrayList<Meeting>();
meetings.add(one);
meetings.add(two);
meetings.add(three);
meetings.add(four);
meetings.add(five);

System.out.println(mergeRanges(meetings).toString());

private static List<Meeting> mergeRanges(List<Meeting> meetings){
  Collections.sort(meetings, new Comparator<Meeting>(){
    
    public int compare(Meeting m1, Meeting m2){
       return m1.getStartTime() - m2.getStartTime();
    }
  });
  
  
  List<Meeting> mergedList = new ArrayList<Meeting>();
  mergedList.add(meetings.get(0));
  
  for (Meeting m : meetings){
    
    Meeting lastMeeting = mergedList.get(mergedList.size() -1);
    if(m.getStartTime() <= lastMeeting.getEndTime()){
       lastMeeting.setEndTime(Math.max(lastMeeting.getEndTime(), m.getEndTime())); 
    }
    
    else {
      mergedList.add(m);
    }
  }
  
  return mergedList;
}