about | help | code help+videos | done | prefs |
public int getSmallest4(int[] nums)
public int getSmallest4(int[] nums) { int smallest = nums[0]; if (nums[1] < smallest) { smallest = nums[1]; } if (nums[2] < smallest) { smallest = nums[2]; } if (nums[3] < smallest) { smallest = nums[3]; } return smallest; }Below is how you would do the same thing using Math.min(). public int getSmallest4(int[] nums) { int smallest = Math.min( nums[0], nums[1] ); smallest = Math.min( smallest, nums[2] ); smallest = Math.min( smallest, nums[3] ); return smallest; } getSmallest4([5, 10, 15, 20]) → 5 getSmallest4([20, 15, 10, 5]) → 5 getSmallest4([3, 6, 9, 12]) → 3 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 1
Copyright Nick Parlante 2017 - privacy