杭电ACM OJ 1040 As Easy As A+B 水（快速排序小变形或者维护当前值输出）_e you some integers, your task is to sort these nu-CSDN博客

本文链接：https://blog.csdn.net/qq_36523667/article/details/78720243

As Easy As A+B

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 67161 Accepted Submission(s): 28611

Problem Description

These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!

Input

Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.

Output

For each case, print the sorting result, and one line one case.

Sample Input

  
  
   
   2
3 2 1 3
9 1 4 7 2 5 8 3 6 9

Sample Output

  
  
   
   1 2 3
1 2 3 4 5 6 7 8 9
  
  
  
  

  
  
  
  
   
   翻译：就是快速排序，只不过有些数字可能是一样的。
  
  
  
  

  
  
  
  
   
   做法：
  
  
  
  
   
   方法1：直接快速排序排好 输出的时候维护当前变量就可以
方法2：快排的时候把相同的数给删了，不太好！
  
  
  
  

  
  
  
  
   
   代码：
  
  
  
  
   
   package ACM1000_1099;

public class AsEasyAsAplusB1040 {
    //3 2 1 3
    //9 1 4 7 2 5 8 3 6 9

    // TODO: 2017/12/5 方法1：直接快速排序排好 输出的时候维护当前变量就可以
    // TODO: 2017/12/5 方法2：快排的时候把相同的数给删了，不太好！

    void calculate() {
        int[] a = {9,1,4,7,2,5,8,3,6,9};

        int len = a.length;

        quickSort(a, 0, len - 1);

        int current = 999;

        for (int i = 0; i < len; i ++) {
            if (current == a[i]) {
                continue;
            }
            System.out.print(a[i] + " ");
            current = a[i];
        }
    }

    void quickSort(int[] a, int start, int end) {
        if (start >= end) {
            return;
        }

        int s = start;
        int e = end;

        int x = a[start];
        int ken = start;

        start ++;

        boolean flag = true;

        while (start <= end) {
            if (flag) {
                if (x > a[end]) {
                    a[ken] = a[end];
                    ken = end;
                    flag = false;
                }
                end --;
            } else {
                if (x < a[start]) {
                    a[ken] = a[start];
                    ken = start;
                    flag = true;
                }
                start ++;
            }
        }

        a[ken] = x;

        quickSort(a, s, ken - 1);
        quickSort(a, ken + 1, e);
    }

    public static void main(final String[] args) throws Exception {
        AsEasyAsAplusB1040 a = new AsEasyAsAplusB1040();
        a.calculate();
    }
}