java学习之路

java：三种经典大排序汇总，冒泡，插入，选择

package arrays.myArray;
public class SortArr {
public static void main(String[] args) {
  int[] arrInt = { 4, 7, 8, 5, 6, 3, 2, 3, 4 };
  maoPaoSort(arrInt);
  print("冒泡排序：", arrInt);
  arrInt = new int[]{ 4, 7, 8, 5, 6, 3, 2, 3, 4 };
& ......

java：ArrayList循环遍历的俩种方法使用

package collection;
import java.util.*;
public class NewArrayList {
public static void main(String[] args) {
  List<Student> students = new ArrayList<Student>();
  for (int i = 0; i < 6; i++) {
   students.add(new Student("Happy"+i,"male" ......

java：Set循环遍历的俩种方法使用

package collection;
import java.util.*;
public class NewSet {
public static void main(String[] args) {
  Set<Student> students = new HashSet<Student>();
  for (int i = 0; i < 6; i++) {
   students.add(new Student("Happy"+i,"male"+i,20+i)) ......

java：递归：汉罗塔游戏计算出最少的步数

package game;
public class HanTa {
public static int i = 0;
public static void main(String[] args){
calc('A', 'B', 'C', 2);
System.out.println("最少需要"+i+"步。");
}

//汉罗塔游戏计算
public static void calc(char src, char ilde, c ......

java：递归：10元钱按1，2，5元任意组合

package game;
public class Money {
public static void main(String[] args) {
fun("", 10);
System.out.println("总共算法：" + i);
}
// 10元钱的组成，1，2，5任意组合
public static int i = 1;
public static void fun(String log, int n) {
......