Stock Buy Sell Once

19 Jun 2019

// Java program to find Maximum difference 
// between two elements such that larger 
// element appears after the smaller number 
class MaximumDiffrence 
{ 
	/* The function assumes that there are at least two 
	   elements in array. 
	   The function returns a negative value if the array is 
	   sorted in decreasing order. 
	   Returns 0 if elements are equal */
	int maxDiff(int arr[], int arr_size) 
	{ 
		int max_diff = arr[1] - arr[0]; 
		int i, j; 
		for (i = 0; i < arr_size; i++) 
		{ 
			for (j = i + 1; j < arr_size; j++) 
			{ 
				if (arr[j] - arr[i] > max_diff) 
					max_diff = arr[j] - arr[i]; 
			} 
		} 
		return max_diff; 
	} 

	/* Driver program to test above functions */
	public static void main(String[] args) 
	{ 
		MaximumDiffrence maxdif = new MaximumDiffrence(); 
		int arr[] = {1, 2, 90, 10, 110}; 
		System.out.println("Maximum differnce is " + 
				maxdif.maxDiff(arr, 5)); 
	} 
} 

// This code has been contributed by Mayank Jaiswal 

// Java program to find Maximum difference 
// between two elements such that larger 
// element appears after the smaller number 
class MaximumDiffrence 
{ 
	/* The function assumes that there are at least two 
	   elements in array. 
	   The function returns a negative value if the array is 
	   sorted in decreasing order. 
	   Returns 0 if elements are equal */
	int maxDiff(int arr[], int arr_size) 
	{ 
		int max_diff = arr[1] - arr[0]; 
		int min_element = arr[0]; 
		int i; 
		for (i = 1; i < arr_size; i++) 
		{ 
			if (arr[i] - min_element > max_diff) 
				max_diff = arr[i] - min_element; 
			if (arr[i] < min_element) 
				min_element = arr[i]; 
		} 
		return max_diff; 
	} 

	/* Driver program to test above functions */
	public static void main(String[] args) 
	{ 
		MaximumDiffrence maxdif = new MaximumDiffrence(); 
		int arr[] = {1, 2, 90, 10, 110}; 
		int size = arr.length; 
		System.out.println("MaximumDifference is " + 
				maxdif.maxDiff(arr, size)); 
	} 
} 

// This code has been contributed by Mayank Jaiswal