蓝桥杯java历年真题及答案整理(共129道题目及答案).docVIP

1.字符排序 算法是这样的，如果给定N个不同字符，将这N个字符全排列，最终的结果将会是N!种。如：给定 A、B、C三个不同的字符，则结果为：ABC、ACB、BAC、BCA、CAB、CBA一共3!=3*2=6种情况。 package Question1_9; import java.util.Scanner; import java.util.Vector; public class Question1 { public static long count=0; private void fullPermutation(VectorCharactersourse, VectorCharacter result) { if(sourse.size()==0){ for (int i = 0; i result.size(); i++) { System.out.print(result.elementAt(i)); } System.out.print(\n); count++; return; } for (int i = 0; i sourse.size(); i++) { VectorCharactertsourse=new VectorCharacter(sourse); VectorCharactertresult=new VectorCharacter(result); tresult.add(sourse.elementAt(i)); tsourse.remove(i); new Question1().fullPermutation(tsourse, tresult); } } public static void main(String[] args) { Scanner scanner=new Scanner(System.in); int n=scanner.nextInt(); VectorCharacter sourse=new VectorCharacter(); VectorCharacter result=new VectorCharacter(); for (int i = 0; i n; i++) { sourse.add((char)(A+i)); } new Question1().fullPermutation(sourse, result); System.out.println(Question1.count); } } 方法二： import java.util.ArrayList; import java.util.Iterator; import java.util.LinkedHashSet; import java.util.List; import java.util.Scanner; import java.util.Set; public class Demo03 { // 去掉重复元素,放入lis public static void removeDuplicate(String s,SetCharacter lis){ for(char x:s.toCharArray()){ lis.add(x); } } // 为方便操作 将 sets 转 lis public static void convert(ListCharacter lis,SetCharacter sets){ IteratorCharacter iter = sets.iterator(); while(iter.hasNext()){ lis.add(iter.next()); } } // 检测符合条件的元素组合 public static void check(SetCharacter sets){ ListCharacter lis = new ArrayListCharacter(); convert(lis,sets); // 为方便操作 将 sets 转 lis StringBuffer sb = new StringBuffer(); for(int i=0;il