package leetcode.find_minimum_in_rotated_sorted_array_ii;

public class Solution {
    public int findMin(int[] num) {
    	int min = num[0];
    	for(int n : num){
    		if(n < min){
    			min = n;
    		}
    	}
    	return min;
    }
}

Add java solution for 154. Find Minimum in Rotated Sorted Array II
Add java solution for 154. Find Minimum in Rotated Sorted Array II

154. Find Minimum in Rotated Sorted Array II: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/