挑战程序设计竞赛（算法和数据结构）——7.2分割（上）JAVA实现

题目：

思路：

示例1：

示例2:


代码如下：

import java.io.BufferedInputStream;
import java.util.Scanner;

public class Partition {
    public static void main(String[] args) {
        Scanner cin = new Scanner(new BufferedInputStream(System.in));
        int n = cin.nextInt();
        int[] A = new int[n];
        for (int i=0;i<n;i++){
            A[i] = cin.nextInt();
        }

        int k = partition2(A,0,n-1);//这个数返回加"[]"的下标，但是不改变数组顺序
        partition1(A,0,n-1);//这个函数改变数组顺序！

        for (int i=0;i<n;i++){
            if (i==k){
                System.out.print("[" + A[i] + "] ");
            }
            else{
                System.out.print(A[i] + " ");
            }
        }
    }

    public static void partition1(int[] A, int p, int r){
        int x = A[r];
        int i = p-1;
        for(int j = p;j<r;j++){
            if(A[j]<=x){
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }
        int temp = A[i+1];
        A[i+1] = A[r];
        A[r] = temp;
    }
    public static int partition2(int[] A, int p, int r){
        int x = A[r];
        int i = p-1;
        for(int j = p;j<r;j++){
            if(A[j]<=x){
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }
        int temp = A[i+1];
        A[i+1] = A[r];
        A[r] = temp;
        return i+1;
    }
}

输入：

12
13 19 9 5 12 8 7 4 21 2 6 11

输出：

9 5 8 7 4 2 6 [11] 12 13 19 21