leafinsnowfield的专栏

//插入排序public class InsertionSort { public static void insertionSort(double[] list) { for(int i=1;i<list.length;i++) { double currentElement=list[i]; int k; for(k=i-1;k>=0&&list[k]>curr

public class RandomCharacter { public static char getRandomCharacter(char ch1,char ch2) { return (char)(ch1+Math.random()*(ch2-ch1+1)); } public static char getRandomLowerCharacter() { return

import java.util.Scanner;public class ComputeAndInterpretBMI { public static void main(String [] args) { Scanner input = new Scanner(System.in); System.out.print("Enter weight in pounds:");

public class TestSum { public static void main(String [] args) { float sum = 0; for(float i=0.01f;i<=1.0f;i+=0.01f)//结果50.499985最后一个i比1大且浮点数导致结果不准确 { sum+=i; } System.out.println("The s

public class PrimeNumber { public static void main(String [] args) { final int NUMBER_OF_PRIMES=50; final int NUMBER_OF_PRIMES_PER_LINE=10; int count=0; int number=2; System.out.println("T

import java.util.Scanner;public class Decimal2HexConversion { public static void main(String [] args) { Scanner input =new Scanner(System.in); System.out.print("Enter a decimal number:"); int

import java.util.Scanner;public class GreatestCommonDivisor { public static void main(String [] args) { Scanner input = new Scanner(System.in); System.out.print("Enter first integer: "); int

import java.util.Scanner;public class PrintCalendar { public static void main(String [] args) { Scanner input=new Scanner(System.in); System.out.print("Enter full year(e.g. 2001)"); int year=

import java.util.Scanner;public class LottoNumbers { public static void main(String [] args) { Scanner input=new Scanner(System.in); boolean [] isCovered=new boolean[99]; int number=input.ne

public class DeckOfCards { public static void main(String [] args) { int [] deck=new int[52]; String [] suits={ "Spades","Hearts","Diamonds","Clubs" }; String [] ranks={ "Ace","2","3

public class LinearSearch { public static int linerSearch(int[] list,int key) { for(int i=0;i<list.length;i++) { if(key==list[i]) return i; } return -1; }}

//二分查找法public class BinarySearch { public static int binarySearch(int[] list,int key) { int low=0; int high=list.length-1; while(high>=low) { int mid=(low+high)/2; if(key<list[mid])

//选择查找public class SelectionSort { public static void selectionSort(double[] list) { for(int i=0;i<list.length-1;i++) { double currentMin=list[i]; int currentMinIndex=i; for(int j=i+1;

import java.util.Arrays.*;public class Array { public static void main(String [] args) { double[] numbers={6.0,4.4,1.9,2.9,3.4,3.5}; java.util.Arrays.sort(numbers); for(int i=0;i<numbers.leng

import javax.swing.JOptionPane;public class SentinelValueUsingConfirmationDialog { public static void main(String [] args) { int sum=0; int option=JOptionPane.YES_OPTION; while(option==JOptio

public class MonteCarloSimulation {//求出pi的值 public static void main(String [] args) { final int NUMBER_OF_TRIALS=10000000; int numberOfHits=0; for(int i=0;i<NUMBER_OF_TRIALS;i++) { double

public class VarArgsDemo {//可变长参数列表 public static void main(String [] args) { printMax(34,3,3,2,56,5); printMax(new double[]{1,2,3}); } public static void printMax(double...numbers) { if

import java.util.Scanner;public class CheckSudokuSolution { public static void main(String[] args) { int[][] grid=readASolution(); System.out.println(isValid(grid)?"Valid solution":"Invalid sol

import java.util.Scanner;public class CheckPalindrome { public static void main(String[] args) { Scanner input=new Scanner(System.in); System.out.print("Enter a string: "); String s=input.nex

import java.util.Scanner;//使用字符生成器的reverse功能的会问字符串的检测public class PalindromeIgnoreNonAlphanumeric { public static void main(String[] args) { Scanner input=new Scanner(System.in); System.out.pr

//计算器public class Calculator { public static void main(String[] args) { if(args.length!=3) { System.out.println("Usage: java Calculator operand1 operator operand2"); System.exit(0); }

public class StackOfIntegers { private int[] elements; private int size; public static final int DEFAULT_CAPACITY=16; public StackOfIntegers() { this(DEFAULT_CAPACITY); } public StackOfInte

import javax.swing.JPanel;import java.awt.Graphics;import java.awt.Polygon;public class PolygonsPanel extends JPanel { protected void paintComponent(Graphics g) { super.paintComponent(g); in

public class GenericSort { public static void main(String[] args) { Integer[] intArray={ new Integer(2),new Integer(4),new Integer(3) }; Double[] doubleArray={ new Double(3.4),new Doub

public class Rational extends Number implements Comparable { private long numerator=0; private long denominator=1; public Rational() { this(0,1); } public Rational(long numerator,long denomina

import java.util.Scanner;public class GuessBirthday { public static void main(String [] args) { String set1 = "1 3 5 7\n" + "9 11 13 15\n" + "17 19 21 23\n" + "25 17 29 31\n"

import java.math.*;public class LargeFactorial { public static void main(String[] args) { System.out.println("50! is \n"+factorial(50)); } public static BigInteger factorial(long n) { BigIn

public class MyStack { private java.util.ArrayList list=new java.util.ArrayList(); public boolean isEmpty() { return list.isEmpty(); } public int getSize() { return list.size(); } public O

public class House implements Cloneable, Comparable { private int id; private double area; private java.util.Date whenBuilt; public House(int id,double area) { this.id=id; this.area=area;

import java.awt.*;import javax.swing.*;public class EightQueens extends JApplet{ public static final int SIZE=8; private int[] queens=new int[SIZE]; public EightQueens() { search(0); add(ne