2017年01月_寂寞开黑

05月 04月 03月 02月 01月

原创三色旗问题

package coding;public class cha09_flag { static int count; static char color[]="rwbwwbrbwr".toCharArray(); static int Blue,White,Red; static void swap(char[] c,int x,int y){ int

2017-01-10 16:32:27 388

原创青蛙过河问题

package coding;import java.util.ArrayList;import java.util.List; class FrogOverRiver { public List<Frog>initializeFrogQueue(){ List<Frog>frogQueue=new ArrayList<Frog>(); frogQueue.add(new

2017-01-10 16:02:08 440

原创马踏棋盘问题

package coding;import java.util.Scanner;class Coordinate{ int x; int y; public Coordinate(int a,int b){ x=a; y=b; }}public class cha09_horse { static int [][] chess

2017-01-10 14:40:10 184

原创 0-1背包问题

package coding;import java.util.Scanner;class GType{ double value; double weight; char isSelect;}public class cha9_backpack { static double maxvalue; static double totalvalue; stati

2017-01-09 14:05:20 168

原创汉诺塔问题

package coding;import java.util.Scanner;public class cha09_hanoi { static long count; static void hanoi(int n,char a,char b,char c){ if(n==1){ System.out.printf("第%d次移动：\t圆盘

2017-01-09 13:23:56 179

原创随机洗牌算法

package coding;import java.util.Random;class Card{ int Suit; char Number;}public class cha10_Shuffle { static Card[] OneCard=new Card[52]; static void ShowCard(){ int i,j;

2017-01-07 21:07:04 217

原创栈解决括号匹配

package coding;import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.Scanner;class Stack{ char[] data; int maxSize; int top;Scanner input=new Scanner(System.in)

2017-01-07 20:29:37 280

原创最小生成树（城市之间的最短距离）

package coding;import java.util.Scanner;/* * 最小生成树求解城市间的最短距离 */class GraphMatrix1{ static final int MaxNum=20; char[] Vertex=new char[MaxNum]; int GType; int VertexNum; int EdgeN

2017-01-07 19:30:48 1401

原创简单约瑟夫环(josephu)

package coding;import java.util.Scanner;public class chap07_josephu { static final int Num=41; static final int Killman=3; static void josephu(int alive){ int[]man=new int[Num];

2017-01-07 16:35:19 259

原创合并排序

package coding;public class cha04_mergeSort { public static final int SIZE=20; static void mergeOne(int a[],int b[],int n,int len){ int i,j,k,s,e; s=0; while(s+len<n){ e=s+2

2017-01-07 16:16:14 157

原创堆排序

package coding;public class cha04_heapSort { static final int SIZE=10; static void heapSort(int []a,int n){ int i,j, k; int t; for(i=n/2-1;i>=0;i--){ while(2

2017-01-07 15:53:16 204

原创快速排序

package coding;public class cha04_quickSort { static final int SIZE=20; public static void quickSort(int [] a,int left,int right ){ int f,t; int rtemp,ltemp; rtemp=right;

2017-01-07 15:12:00 199

原创 shell（缩小增量）排序

package coding;public class cha04_shellSort { static final int SIZE=10; public static void shellSort(int[] a){ int i,j, h; int r,temp; int x=0; for(r=a.length/2;

2017-01-07 14:32:47 323

原创插入排序

package coding;public class cha04_insertSort { static final int SIZE=20; public static void insertSort(int [] a){ int i,j,t,h; for(i=1;i<a.length;i++){ t=a[i];

2017-01-07 14:12:46 152

原创选择排序

package coding;public class cha04_selectSort { static final int SIZE=20; public static void selectSort(int [] a){ int index,temp; for(int i=0;i<a.length-1;i++){ inde

2017-01-07 13:55:36 155

原创冒泡排序

package coding;public class cha04_bubbleSort { static final int SIZE=10; public static void bubbleSort(int[] a){ int temp; for(int i=1;i<a.length;i++){ for(int j=0;

2017-01-07 10:06:34 162

原创蒙特卡罗概率计算PI

package coding;import java.util.Scanner;public class cha03_MontePI { static double MontePI(int n){ double PI; double x,y; int i, sum; sum=0; for(i=1;i<n;i++){

2017-01-07 09:53:05 491

原创兔子产子问题（斐波那契数列）

package coding;import java.util.Scanner;/* * 兔子产子问题 * fibonacci数列求解 */public class cha03_rabbitSon { public static int fibonacci(int n){ int t1,t2; if(n==1||n==2){ re

2017-01-07 09:27:14 464

原创穷举求解鸡兔同笼问题

package coding;import java.util.Scanner;/* * 鸡兔同笼问题 * 穷举解决 * */public class cha03_ChikenRabbit { static int chiken,rabbit; public static int qiongju(int head,int foot){ int re,i,j;

2017-01-07 09:15:18 672

原创分治解决假硬币问题

package testing_03;import java.util.Scanner;/* * * high，low，n; * */public class test_13 { //static final int MAXNUM=30; static int FalseCoin(int coin[],int low,int high){ int i

2017-01-03 17:15:42 1570 2