Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public int centeredAverage(int[] nums) {
- int smallest = nums[0];
- int largest = nums[0];
- int averooge = 0;
- for(int i = 0; i < nums.length; i++) {
- if(nums[i] < smallest) {
- smallest = nums[i];
- }
- }
- for(int j =0; j < nums.length; j++) {
- if(nums[j] > largest) {
- largest = nums[j];
- }
- }
- int[] average = new int[nums.length-2];
- for(int z = 0; z < nums.length; z++) {
- if(nums[z] != smallest || nums[z] != largest) {
- nums[z] = average[z];
- }
- for (int c = 0; c < average.length; c++) {
- averooge += average[c];
- }
- }
- return (averooge/(average.length));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement