|
32 | 32 |
|
33 | 33 |
|
34 | 34 |
|
35 | | - function computeMaximum(arrayOfNumbers){ |
36 | | - |
37 | | - var maximum = 0; |
38 | | - for (var i = 0; i < arrayOfNumbers.length; i++) { |
39 | | - |
40 | | - if (arrayOfNumbers[i] > maximum) { |
41 | | - maximum = arrayOfNumbers[i]; |
42 | | - } |
43 | | - } |
44 | | - |
45 | | - return maximum; |
46 | | - }; |
| 35 | + |
47 | 36 |
|
48 | 37 | function oneLineRepresentationOfSolution(index, score, price, highScore) { |
49 | 38 |
|
|
69 | 58 |
|
70 | 59 | }; |
71 | 60 |
|
72 | | - /** |
73 | | - * Return an array containing zero or more indexes into the |
74 | | - * arrayOfNumbers such that arrayOfNumbers[ index ] == valueToMatch. |
75 | | - */ |
76 | | - function indexesWithValue(arrayOfNumbers, valueToMatch) { |
77 | | - |
78 | | - var indexes = []; |
79 | | - |
80 | | - // find the indexes having that highest score |
81 | | - for (var i = 0; i < arrayOfNumbers.length; i++) { |
82 | | - if (arrayOfNumbers[i] == valueToMatch) { |
83 | | - indexes.push(i); |
84 | | - } |
85 | | - } |
86 | | - |
87 | | - return indexes; |
88 | | - }; |
| 61 | + |
89 | 62 |
|
90 | 63 | function indexesOfCheapestSolutionsWithHighestScore(scores, prices) { |
91 | 64 |
|
|
114 | 87 | return cheapestSolutionsWithHighScore; |
115 | 88 | }; |
116 | 89 |
|
| 90 | + |
| 91 | + // Generic Array functions. |
| 92 | + |
| 93 | + /** |
| 94 | + * Return an array containing zero or more indexes into the |
| 95 | + * arrayOfNumbers such that arrayOfNumbers[ index ] == valueToMatch. |
| 96 | + */ |
| 97 | + function indexesWithValue(arrayOfNumbers, valueToMatch) { |
| 98 | + |
| 99 | + var indexes = []; |
| 100 | + |
| 101 | + // find the indexes having that highest score |
| 102 | + for (var i = 0; i < arrayOfNumbers.length; i++) { |
| 103 | + if (arrayOfNumbers[i] == valueToMatch) { |
| 104 | + indexes.push(i); |
| 105 | + } |
| 106 | + } |
| 107 | + |
| 108 | + return indexes; |
| 109 | + }; |
| 110 | + |
| 111 | + function computeMaximum(arrayOfNumbers){ |
| 112 | + |
| 113 | + var maximum = 0; |
| 114 | + for (var i = 0; i < arrayOfNumbers.length; i++) { |
| 115 | + |
| 116 | + if (arrayOfNumbers[i] > maximum) { |
| 117 | + maximum = arrayOfNumbers[i]; |
| 118 | + } |
| 119 | + } |
| 120 | + |
| 121 | + return maximum; |
| 122 | + }; |
| 123 | + |
117 | 124 | </script> |
118 | 125 | </head> |
119 | 126 | <body> |
|
0 commit comments