遍歷所有排列的數(shù)據(jù)：例 123將之拆分的 ‘1’ ‘2’ ‘3‘ 用一數(shù)組存取存在的數(shù),雖然這辦法效率不高,但能你實(shí)現(xiàn)你的所要的效果,你按這個(gè)思想寫一下吧.實(shí)在不行,我再幫你寫一個(gè)不是很明白你的思路，你要能寫，最好不過！這幾天有事，我寫了一個(gè)，你參考一下吧：public class Sample{public static void main(String[] args){String[] data = {"123","12","234"}; //你的排列數(shù)據(jù)char []c = new char[32]; //存放將String轉(zhuǎn)換為char數(shù)組char ret[] = new char[32];//存放結(jié)果int i,dlength,a,j,z,flag;a = 0;for(i = 0; i < 3; i++){c = data[i].toCharArray();dlength = data[i].length();for(j = 0; j < dlength; j++){flag = 1;for(z = 0; z < a; z++){if(ret[z] == c[j]){flag = 0;break;}}if(flag == 1)ret[a++] = c[j];}}System.out.print("ret: ");for(i = 0; i < a; i++)System.out.print(ret[i]+" ");}}