算法,思维
just4download1
这个作者很懒,什么都没留下…
展开
-
最大数与最小数
[code="java"]public class MaxAndMin { public static void main(String []args) { int a[] = {1,1,1,1,1,1,1,1}; findSecondMax(a); } //找出数组中最大的跟最小的 public static voi...原创 2011-05-22 21:41:47 · 202 阅读 · 0 评论 -
最大连续整数
[code="java"]public class Succession { static int num = 5, m = 5; static int k ; static boolean find; static int logo[] = new int[num]; static int stamp[] = {0,1,4,12,21}; //在剩余n中组...2011-05-22 21:47:22 · 112 阅读 · 0 评论 -
数组全排列
[code="java"]public class AllSort { public static void main(String[] args) { int a[] = {1,2,3}; sort(a,0); } public static void swap(int i,int j,int a[]) { //if(i==...原创 2011-05-22 21:48:24 · 80 阅读 · 0 评论 -
子数组的最大和
[code="java"]public class SubarrayMax { public static void main(String[] args) { int[] a = {8,-1,-1,5,3,2,8,-9}; System.out.println(method1(a,a.length)); System.out.println(...原创 2011-05-23 09:59:53 · 76 阅读 · 0 评论 -
砝码称重问题
[code="java"]public class Poise { public static void main(String[] args) { int []poise = {1,2,5,10}; int []num = {1,1,1,1}; int max= 100; int flag[] = new int[101]; flag...原创 2011-05-24 20:08:33 · 92 阅读 · 0 评论 -
拆分成连续整数的和
[code="java"]import java.io.DataInputStream;import java.math.BigInteger;import java.util.Scanner;public class IntegerContinue { public static void main(String[] args) { Scanne...原创 2011-05-26 09:12:42 · 139 阅读 · 0 评论 -
数组循环移位
[code="java"]package alogrithm;public class RightShift { public static void reverse(int[] num,int begin,int end) { for(;begin原创 2011-05-26 16:41:25 · 78 阅读 · 0 评论 -
分治思想找24
原文:[url]http://hi.baidu.com/cesul/blog/item/998796880ba02899a5c2720b.html[/url][code="java"]import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.HashSet;impo...2011-05-28 10:14:09 · 89 阅读 · 0 评论 -
栈实现队列(维护最大值)
[code="java"]package alogrithm;import java.util.EmptyStackException;public class MyStack { private int stackTop ; private int maxStackItemIndex ; private final int MAX = 20;...原创 2011-06-14 20:03:00 · 322 阅读 · 0 评论