1133————C语言训练-求1+2!+3!+...+N!的和
importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);while(scanner.hasNext()){intn=scanner.n
题解列表
数据结构-链表的基本操作-JAVA实现题解
importjava.util.Arrays;importjava.util.LinkedList;importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[]args){Scannersc=newScanner(Syste
[编程入门]链表合并-JAVA题解
importjava.util.ArrayList;importjava.util.Arrays;importjava.util.Comparator;importjava.util.Scanner;publicclassMain{//通过集合的比较器对传进来的链表进行排序publicstaticvo
[编程入门]三个字符串的排序-JAVA题解
importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[]args){String[]arr=newString[3];Scannersc=newScanner(System.in);//输入字符串for(inti=0;i
1160————出圈
importjava.util.Scanner;importjava.util.LinkedList;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);while(scanne
1530: 蓝桥杯算法提高VIP-数字黑洞（java）
```javaimportjava.util.*;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);intnum=scanner.nextInt();intcount=0;in
1389: 程序员的表白(Java解）
```javaimportjava.util.*;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);while(scanner.hasNext()){Stringinput=s
危险系数dfs深搜回溯解题，详细注释
```javaimportjava.util.Scanner;publicclassMain{staticintn;//顶点staticintm;//通道staticint[][]map;staticboolean[]visited;staticint[]nodes;//每条可行路径上经过的点stat
2015: 自动晾衣机(19行！！！)
importjava.util.*;publicclass自动洗衣机{publicstaticvoidmain(String[]args){Scannersc=newScanner(System.in);intn=sc.nextInt();//衣架总长度while(sc.hasNext()){inta
3021————Pell数列（仿）
importjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);intn=scanner.nextInt();//输入几组测试数据while(