数据结构
相信东哥
保持一颗菜鸟的心
展开
-
求两个三位数之间的所有水仙花数
import java.util.ArrayList;import java.util.Arrays;import java.util.Iterator;import java.util.List;import java.util.Scanner;public class ShuiXianFlower { public static void main(String[] arg原创 2016-04-01 11:41:29 · 930 阅读 · 0 评论 -
Given a collection of distinct numbers, return all possible permutations.排列组合
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].im原创 2016-04-01 13:10:16 · 694 阅读 · 0 评论 -
Given an unsorted integer array, find the first missing positive integer.
/*Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant spa原创 2016-04-01 13:50:58 · 692 阅读 · 0 评论 -
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missi
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.利用等差数列求和公式即可,空间复杂度为1,算法复杂原创 2016-04-01 13:17:50 · 941 阅读 · 0 评论 -
快速排序
/** 递归实现快速排序法,作者梁广东时间:2016/3/31*/public class QuickSort {public static void main(String[] args) {// TODO Auto-generated method stubint[] n=new int[]{5,3,6,1,8,2,1,2,19};quick原创 2016-04-01 11:54:39 · 240 阅读 · 0 评论 -
基数排序之java实现
import java.util.Arrays;public class JiShuPaiXu { public static void main(String[] args) { int[] data = new int[] { 1100, 192, 221, 12, 23 }; print(data); radixSort(data, 10原创 2016-04-01 13:14:18 · 291 阅读 · 0 评论 -
归并排序java实现
public class GuiBingSort { public static void main(String[] args) { int[] nums = { 2, 7, 8, 3, 1, 6, 9, 0, 5, 4 ,4,5}; GuiBingSort.sort(nums, 0, nums.length-1); for(int a:nums)原创 2016-04-01 11:37:23 · 290 阅读 · 0 评论