u014230945的博客

1、可以使用位数组排序的前提是数组中的元素不能有重复数字，而且这个数组可以无序，但数组中元素出现有最大范围限制。2、遍历元数组，将原数组的中的元素存放到事先创建好的位数组的指定位上。3、重新遍历位数组中的每个位如果为true的化，则附加到最终结果上。// 使用BitSet进行排序 private static String sortNums(Integer[] integers) { long start = System.currentTimeMillis();

public class Main { private static TreeNode<Integer> ans; private static boolean dfs(TreeNode<Integer> root, TreeNode<Integer> p, TreeNode<Integer> q) { if (root == null) { return false; } .

public static List<List<Integer>> permute(int[] nums) { List<List<Integer>> res = new ArrayList<>(); int len = nums.length; if (len == 0) { return res; } Stack<Integer> path = new Stack<&.

public static boolean isPopOrder01(int[] pushA, int[] popA) { if (pushA.length == 0 || popA.length == 0) { return false; } int popIndex = 0; Stack<Integer> stack = new Stack<>(); for (int num : pushA) { st.

package LinkedListDemo;public class Main { public static Node mergeSortLinkedList(Node head1, Node head2) { if (head1 == null) { return head2; } if (head2 == null) { return head1; } .

package LongestIncrSub;import java.util.Arrays;import java.util.HashSet;/** * 功能描述 * 最长递增子序列 */public class Main { public static void getLongestIncrSub(int[] arr) { int len = arr.length; int[] dp = new int[len]; int[].

public class Test47 {public static void main(String[] args) {int []arr={1,7,17,2,6,3,14,16,4};for(int i=0;ifor(int j=i+1;jif(arr[i]+arr[j]==20){System.out.println(arr[i]+" "+arr[j]);}}

import java.util.Arrays;import java.util.Scanner;public class Test44 {public static void main(String[] args) {int num=51762;System.out.println("输入去掉的位数: ");Scanner in=new Scanner(Sys

package 套娃问题;import java.util.Collections;import java.util.Comparator;import java.util.LinkedList;import java.util.Scanner;class Node {public int w;public int h;public int

package 反转单词;//输入 I have a dream!//输出 I a evah !maerd  import java.util.Scanner;public class Test01 {public static String reserve(String str) {if (str == null) {return null;}

public class OneNumber{    public static int getOneNumber(int num){        int sum = 0;        while(num != 0){            num  &amp;= num - 1;            sum++;        }        return sum;  ...

public class Test01 {public static void main(String[] args) {int x=1;int y=3;int z=2;if(x>y){x=x^y;y=x^y;x=x^y;}if(x>z){x=x^z;z=x^z;x=x^z;}if(y>z){y=y^z;z=y^z;y=y^z

public class Test48 {public static String reserve(String s){if(s==null || s.length()==0){return null;}int i=s.indexOf(" ");if(i==-1){return s; //当处理到最后一个单词的时候就需要这样处理了。}return reserve

package 循环队列;public class CirclyQueue {int [] arr=null; //数组，队列中最多存储arr.length-1个元素。int front; //队首指针int rear;  //队尾指针int realLen;//队列长度public CirclyQueue(){this(10);}public Ci

public class JavaRandom{    public static void main(String[] args) {        // Java获取数组中随机的一个元素        int [] arr = {1,2,3,4};        产生0-(arr.length-1)的整数值,也是数组的索引        int index=(int)(Math.r...

public class Prime{        public static boolean isPrime(int num){                System.out.println(num + "的开方是:" + Math.sqrt(num));        boolean flag = true; //默认为素数        if(num &lt; 2){...

public class Sum{    //计算一个数字所有的约数    public static void getYuShu(int num){        int sum = 0;        for(int i=num-1;i&gt;=1;i--){            if(num % i ==0){                sum += i;        ...

public class MaxProfit { private final int Len_Days = 20; private final int Max_Price = 100; private int buyDay = 0; private int sellDay =0; public int[] startPrice = new int[Le...

package day20170107;importjava.io.FileInputStream;import java.io.FileOutputStream;import java.io.IOException;publicclass InputString {    publicstatic void main(String[] args) {     

public class Test01 {public static void fun1(){int m=1;for(int i=10;i>0;i--){m=2*m+2;}System.out.println("1: "+m);}public static void main(String[] args) {int after=1;for(int

package 字符常用方法;import java.util.Arrays;public class Test {// 将字节数组变换成字符串public static void fun1() {byte[] arr = { 65, 66, 67, 68 };String string = new String(arr);System.out.prin

package 知识点总和;import java.util.Map;import java.util.TreeMap;public class Test02 {public static void main(String[] args) {String []arr={"if","it","is","to","be","it","is","am","happy"

package day20170107;class X{Y y=new Y();public X(){System.out.print("X");}}class Y{public Y(){System.out.print("Y");}}class Z extends X{Y y=new Y();public Z(){Sys

package day20170107;class MMM{public static void main(String[] args) {// TODO 自动生成的方法存根System.out.println("fafdasf");}}public class MainTest {public static void main(String[] args)

package 面试题目;//==比较的是字符串连接池中的地址。。//equals 比较的真正的是内容不是其他的东西。public class StringDemo2 {    public static void main(String[] args) {       // TODO自动生成的方法存根       String str1="abc";     

package day20170107;import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Combination {public static void listAll(List candidate,String preifx){//

package day20170107;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;class InputData {public static String string = null;public static

import java.util.Scanner; public class DaysCelandar {    // 判断是不是闰月年    public static boolean isRun(int year) {       if ((year % 4 == 0 && year % 100 != 0) || year %100 == 0) {       

package day05;//抽象类中的getTime();就是模板方法。。也就是这样的方法就做这样的事情。abstract class Model{public long getTime(){long s=System.currentTimeMillis();code(); long e=System.currentTimeMillis();return e

今天写的一点儿东西，感觉没有什么实际的用处。但是写出来还是感觉比较踏实！！         new 是在对内存中开辟空间，为离散的结构         1：线性表的节点空间消耗比较大，这样会引起的问题是浪费了存储空间但是可以实现动态的扩充，对于大量的增加和删除操作比较合适。但是对于顺序表来说，大体就是固定的存储空间，适合随机访问，也就是按照序号来对于元素进行访问。单向链表插入和删除元素平均

package day20170107;public class NULL {public static void haha(){System.out.println("haha");}public static void main(String []args){((NULL)null).haha();}}

package day20170108;import java.util.Stack;public class MonthStack {public static String[] months = { "January", "February", "March", "April","May", "June", "July", "August", "Septembe

package 知识点总和;import java.util.HashMap;import java.util.Map;public class Test01 {public static Map getCharMaps(String string){Map map=new HashMap();for(int i=0;iCharacter charact

package 一个数被质数分解;public class Test {public static void decompose(int n){System.out.print("n=");if(n==0 || n==1){System.out.print(n);}for(int i=2;iwhile(n%i==0 && n!=i){n=n/i;Sy

package 水仙花树;// 100-999之间的水仙花数public class Test {public static boolean isNumber(int n) {boolean flag = false;int m = n;int sum = 0;int k = m / 100;m = n - k * 100;sum +

package 最大连续子数组;public class SubArray {public static void main(String[] args) {int[] arr = new int[] { 1, -2, 3, 10, -4, 7, 2, -5 };int sum = getArraySum(arr);System.out.println(sum);}

package day18;public class day19 {public static void main(String[] args) {int a="abc".length();System.out.println(a);//3double d=10;Double dd=new Double(d);int ddd=dd.intValue();System

package day14;public class StringDemo01 {/*public static void main(String[] args) {String i="";if(i==i+0){System.out.println("hello world");}else{System.out.println("123");}}*/

package day20170108;import java.util.LinkedList;import java.util.Queue;public class MonthQueue {public static String[] months = { "January", "February", "March", "April","May", "June

package com.ipmotor.sm.db;import java.util.LinkedList;import java.util.Queue;import java.util.Stack;/** * 测试jdk中的栈和队列 * @author scott * */public class TestQueueAndStack {