DescendingOrder

Your task is to make a function that can take any non-negative integer as a argument and return it with it's digits in descending order. Essentially, rearrange the digits to create the highest possible number.

package com.demo;
/**
 * 对一个数字进行重组,使其值最大
 *
 */
public class DescendingOrderTest {
	public static void main(String[] args) {
		System.out.println(sortDesc(453910));//输出954310
	}

	public static int sortDesc(final int num) {
		// Your code
		String s = String.valueOf(num);
		char[] ch=s.toCharArray();
		int j = s.length();
		quickSort(0,j-1,ch);

		String str = "";
		for (j=j-1; j >= 0; j--) {
			str=str+ch[j];
		}
		int a = Integer.valueOf(str);
		return a;
	}
	
	public static void quickSort(int left,int right,char[] ch) {
		if(right-left<=0) return ;
		else {
			int piovt=ch[right]-'0';
			int partition=partitionIt(left,right,piovt,ch);
			quickSort(left,partition-1,ch);
			quickSort(partition+1,right,ch);
		}
		

	}
	public static int partitionIt(int left,int right,int piovt,char[] ch) {
		int leftPtr=left-1;
		int rightPtr=right;
		while(true) {
			while((ch[++leftPtr]-'0')<piovt);
			while(rightPtr>0 && (ch[--rightPtr]-'0')>piovt);
			if(leftPtr>=rightPtr) break;
			else {
				swap(leftPtr,rightPtr,ch);
			}
		}
		swap(leftPtr,right,ch);
		return leftPtr;
	}
	public static void swap(int left,int right,char[] ch) {
		char tmp=ch[left];
		ch[left]=ch[right];
		ch[right]=tmp;
	}
}