3194. Minimum Average of Smallest and Largest Elements Easy

1/**
2 * [3194] Minimum Average of Smallest and Largest Elements
3 *
4 * You have an array of floating point numbers averages which is initially empty. You are given an array nums of n integers where n is even.
5 * You repeat the following procedure n / 2 times:
6 * 
7 * 	Remove the smallest element, minElement, and the largest element maxElement, from nums.
8 * 	Add (minElement + maxElement) / 2 to averages.
9 * 
10 * Return the minimum element in averages.
11 *  
12 * <strong class="example">Example 1:
13 * <div class="example-block">
14 * Input: <span class="example-io">nums = [7,8,3,4,15,13,4,1]</span>
15 * Output: <span class="example-io">5.5</span>
16 * Explanation:
17 * <table>
18 * 	<tbody>
19 * 		<tr>
20 * 			<th>step</th>
21 * 			<th>nums</th>
22 * 			<th>averages</th>
23 * 		</tr>
24 * 		<tr>
25 * 			<td>0</td>
26 * 			<td>[7,8,3,4,15,13,4,1]</td>
27 * 			<td>[]</td>
28 * 		</tr>
29 * 		<tr>
30 * 			<td>1</td>
31 * 			<td>[7,8,3,4,13,4]</td>
32 * 			<td>[8]</td>
33 * 		</tr>
34 * 		<tr>
35 * 			<td>2</td>
36 * 			<td>[7,8,4,4]</td>
37 * 			<td>[8,8]</td>
38 * 		</tr>
39 * 		<tr>
40 * 			<td>3</td>
41 * 			<td>[7,4]</td>
42 * 			<td>[8,8,6]</td>
43 * 		</tr>
44 * 		<tr>
45 * 			<td>4</td>
46 * 			<td>[]</td>
47 * 			<td>[8,8,6,5.5]</td>
48 * 		</tr>
49 * 	</tbody>
50 * </table>
51 * The smallest element of averages, 5.5, is returned.</div>
52 * <strong class="example">Example 2:
53 * <div class="example-block">
54 * Input: <span class="example-io">nums = [1,9,8,3,10,5]</span>
55 * Output: <span class="example-io">5.5</span>
56 * Explanation:
57 * <table>
58 * 	<tbody>
59 * 		<tr>
60 * 			<th>step</th>
61 * 			<th>nums</th>
62 * 			<th>averages</th>
63 * 		</tr>
64 * 		<tr>
65 * 			<td>0</td>
66 * 			<td><span class="example-io">[1,9,8,3,10,5]</span></td>
67 * 			<td>[]</td>
68 * 		</tr>
69 * 		<tr>
70 * 			<td>1</td>
71 * 			<td><span class="example-io">[9,8,3,5]</span></td>
72 * 			<td>[5.5]</td>
73 * 		</tr>
74 * 		<tr>
75 * 			<td>2</td>
76 * 			<td><span class="example-io">[8,5]</span></td>
77 * 			<td>[5.5,6]</td>
78 * 		</tr>
79 * 		<tr>
80 * 			<td>3</td>
81 * 			<td>[]</td>
82 * 			<td>[5.5,6,6.5]</td>
83 * 		</tr>
84 * 	</tbody>
85 * </table>
86 * </div>
87 * <strong class="example">Example 3:
88 * <div class="example-block">
89 * Input: <span class="example-io">nums = [1,2,3,7,8,9]</span>
90 * Output: <span class="example-io">5.0</span>
91 * Explanation:
92 * <table>
93 * 	<tbody>
94 * 		<tr>
95 * 			<th>step</th>
96 * 			<th>nums</th>
97 * 			<th>averages</th>
98 * 		</tr>
99 * 		<tr>
100 * 			<td>0</td>
101 * 			<td><span class="example-io">[1,2,3,7,8,9]</span></td>
102 * 			<td>[]</td>
103 * 		</tr>
104 * 		<tr>
105 * 			<td>1</td>
106 * 			<td><span class="example-io">[2,3,7,8]</span></td>
107 * 			<td>[5]</td>
108 * 		</tr>
109 * 		<tr>
110 * 			<td>2</td>
111 * 			<td><span class="example-io">[3,7]</span></td>
112 * 			<td>[5,5]</td>
113 * 		</tr>
114 * 		<tr>
115 * 			<td>3</td>
116 * 			<td><span class="example-io">[]</span></td>
117 * 			<td>[5,5,5]</td>
118 * 		</tr>
119 * 	</tbody>
120 * </table>
121 * </div>
122 *  
123 * Constraints:
124 * 
125 * 	2 <= n == nums.length <= 50
126 * 	n is even.
127 * 	1 <= nums[i] <= 50
128 * 
129 */
130pub struct Solution {}
131
132// problem: https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/
133// discuss: https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/discuss/?currentPage=1&orderBy=most_votes&query=
134
135// submission codes start here
136
137impl Solution {
138    pub fn minimum_average(nums: Vec<i32>) -> f64 {
139        0f64
140    }
141}
142
143// submission codes end
144
145#[cfg(test)]
146mod tests {
147    use super::*;
148
149    #[test]
150    fn test_3194() {
151    }
152}
153