-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfindSongs.java
65 lines (52 loc) · 2 KB
/
findSongs.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'findSongs' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts following parameters:
* 1. INTEGER rideDuration
* 2. INTEGER_ARRAY songDurations
*/
public static List<Integer> findSongs(int rideDuration, List<Integer> songDurations) {
// Write your code here
List<Integer> returnList = new ArrayList<>();
Map<Integer , Integer> songsIdMap = new LinkedHashMap<>() ;
List<Integer> maxDurations = new ArrayList<>() ;
int songsTotalDuration = rideDuration - 30 ;
for ( int i = 0 ; i<songDurations.size()-1 ; i++){
for ( int j = i+1 ; j<songDurations.size() ; j++ ){
if(songDurations.get(i)+songDurations.get(j)==songsTotalDuration){
songsIdMap.put(i,j);
maxDurations.add(Math.max(songDurations.get(i) ,
songDurations.get(j))) ;
break;
}
}
}
if(songsIdMap.size()<1){
returnList.add(-1);
returnList.add(-1);
return returnList;
}
//get the max duration out of all the possible combinations
int maxValue = Collections.max(maxDurations) ;
int index = maxDurations.indexOf(maxValue) ;
//get the id of songs pair
Integer a = ( Integer) songsIdMap.keySet().toArray()[index] ;
Integer b = ( Integer) songsIdMap.get(a) ;
returnList.add(a);
returnList.add(b);
return returnList ;
}
}