遞迴方法判斷陣列中的元素是否有序(Java實現)
阿新 • • 發佈:2019-02-15
import java.util.Scanner; class IsSort { public int isArrayInSortedOrder(int[] a, int index) { if (index == 1) { return 1; } else { return (a[index - 1] <= a[index - 2]) ? 0 : isArrayInSortedOrder(a, index - 1);升序 } } } public class Main { public static void main(String[] args) { // write your code here Scanner scan = new Scanner(System.in); int[] a = {1, 2, 3, 4, 5}; IsSort sort = new IsSort(); int res = sort.isArrayInSortedOrder(a, 5); System.out.println(res); } }
以上程式碼是判斷是否為升序,如果想判斷是否為降序只要修改一處即可.
return (a[index - 1] <= a[index - 2]) ? 0 : isArrayInSortedOrder(a, index - 1);