Advertisement
Guest User

Untitled

a guest
Jul 23rd, 2019
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. public int centeredAverage(int[] nums) {
  2. int smallest = nums[0];
  3. int largest = nums[0];
  4. int averooge = 0;
  5.  
  6. for(int i = 0; i < nums.length; i++) {
  7. if(nums[i] < smallest) {
  8. smallest = nums[i];
  9. }
  10. }
  11. for(int j =0; j < nums.length; j++) {
  12. if(nums[j] > largest) {
  13. largest = nums[j];
  14. }
  15. }
  16.  
  17. int[] average = new int[nums.length-2];
  18.  
  19. for(int z = 0; z < nums.length; z++) {
  20. if(nums[z] != smallest || nums[z] != largest) {
  21. nums[z] = average[z];
  22. }
  23.  
  24. for (int c = 0; c < average.length; c++) {
  25. averooge += average[c];
  26. }
  27. }
  28. return (averooge/(average.length));
  29. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement