藍(lán)橋杯大賽java歷年真題及答案整理(閉關(guān)一個(gè)月嘔心瀝血整理出來(lái)的)

1藍(lán)橋杯 java 歷年真題及答案整理(閉關(guān)一個(gè)月,嘔心瀝血整理出來(lái)的)1. 算法是這樣的，如果給定 N 個(gè)不同字符，將這 N 個(gè)字符全排列，最終的結(jié)果將會(huì)是 N!種。如：給定 A、B、C 三個(gè)不同的字符，則結(jié)果為：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(Vectorsourse, Vector result) {if(sourse.size()==0){for (int i = 0; i tsourse=new Vector(sourse);Vectortresult=new Vector(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();Vector sourse=new Vector();Vector result=new Vector();for (int i = 0; i vector=new Vector();for (int i = 0; i = a private static boolean isfilter(Vector result) {int a=(result.elementAt(0)- 0 )*10+(result.elementAt(1)- 0 );int b=(result.elementAt(2)- 0 )*10+(result.elementAt(3)- 0 );int c=(result.elementAt(4)- 0 )*10+(result.elementAt(5)- 0 );int d=(result.elementAt(6)- 0 )*100+(result.elementAt(7)- 0 )*10+(result.elementAt(8)- 0 );if(a*b==c*d){return true;}return false;}public static void print(Vectorvector) {5System.out.printf(“%c%c x %c%c = %c%c x %c%c%c“,vector.elementAt(0),vector.elementAt(1),vector.elementAt(2),vector.elementAt(3),vector.elementAt(4),vector.elementAt(5),vector.elementAt(6),vector.elementAt(7),vector.elementAt(8));}private static void fullPermutation(Vector sourse, Vector result) {if(sourse.size()==0for (int i = 0; i (result));}return;}for (int i = 0; i sourse=new Vector();Vector result=new Vector();for (int i = 1; i ();Question3.fullPermutation(sourse, result);for (int i = 0; i 0) {String string=scanner.nextLine();String strings[]=string.split(“C“);strings[0]=strings[0].substring(1, strings[0].length());int hangshu=Integer.parseInt(strings[0]),lieshu=Integer.parseInt(strings[1]);//獲取行數(shù)和列數(shù)/** 對(duì)列數(shù)進(jìn)行變換*/Stackstack=new Stack();while(lieshu0){if(lieshu%26==0){stack.push( Z );lieshu=lieshu/26-1;}else {stack.push((char)( A -1+lieshu%26));lieshu=lieshu/26;}}while (!stack.empty()) {System.out.print(stack.pop());}System.out.println(hangshu);n--;}}}運(yùn)行結(jié)果：輸入一個(gè)整數(shù) n(n0) {String telphone=scanner.nextLine();int sum=0;/** 情況一*/if(telphone.charAt(0)-telphone.charAt(1)==1){char ch=telphone.charAt(0);int index=0;while (index=4){sum+=5;}}if (telphone.charAt(0)-telphone.charAt(1)==-1) {char ch=telphone.charAt(0);int index=0;while (index=4){sum+=5;}}/** 情況二*/if (telphone.charAt(0)==telphone.charAt(1)}if(telphone.charAt(1)==telphone.charAt(2)}/** 情況三*/10if(telphone.charAt(0)==telphone.charAt(1)}if(telphone.charAt(0)==telphone.charAt(2)}/** 情況四*/for (int i = 0; i a = new Stack();for (int i = 0; i = 0 }if(used==size){//size位全部分配完畢if(pareTo(MIN)=0){for (int i = 0; i 0){return;}usedTimes[arrayIndex]=i;exhaustion(arrayIndex-1, used+i,current.add(iPowSizeMultiplyj[arrayIndex][i]));usedTimes[arrayIndex]=0;}}else {return;//1到 9已分配完畢, 不可再延伸了}}public static void main(String[] args) {// Scanner scanner = new Scanner(System.

總結(jié)

以上是生活随笔為你收集整理的蓝桥杯Java历年真题与答案_蓝桥杯大赛java历年真题及答案整理(闭关一个月呕心沥血整理出来的)...的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。