叨叨令

先给出数组实现： package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_2_2Mystack<E>{ //数组实现方法 private Object[] stack; private int size; public 题8_2_2Mystack(){ stack=new Object[...

package java程序员面试笔试宝典;public class 题8_5_11求数对之差的最大值 { //二分查找法没有做，感觉很复杂 public static void main(String[] args) { int[] a={1,4,17,3,2,9}; //System.out.println(getMax(a)); //getMax_0(a); get...

package java程序员面试笔试宝典;public class 题8_5_12求绝对值最小的数 { public static void main(String[] args) { int[] a0={-12,0,3}; int[] a1={-12,-10,-5,-2,7,15,50,90}; int[] a2={2,4,6,8,27}; int[] a3={-13,...

package java程序员面试笔试宝典;public class 题8_5_13求数组中两个元素的最小距离 { public static void main(String[] args) { int[] a={4,5,6,4,7,4,6,4,7,8,5,6,4,3,10,8}; int[] b={3,4}; //getMinDis(6, 11, a); getMinD...

package java程序员面试笔试宝典;public class 题8_5_14求指定数字在数组中第一次出现的位置 { public static void main(String[] args) { int[] a={3,4,5,6,5,6,7,8,9,8}; System.out.println(findIndex_0(a,12)); } public stati...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_15对数组两个子有序段进行合并 { public static void main(String[] args) { int[] a={1,3,5,6,56,2,4,8,10,13,14}; sort_0(a, 5); for (int i : a...

package java程序员面试笔试宝典;import java.util.List;import java.util.ArrayList;import java.util.HashMap;import java.util.HashSet;import java.util.Map;import java.util.Set;public class 题8_5_16计算有序整型数...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_17判断相邻数组中数值是否连续 { public static void main(String[] args) { int[] a={0,0,10,0,6}; System.out.println(isContinue_0(a)); } pu...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_18求解数组中反序对个数 { //归并排序算法没有明白,照着敲了一遍,但是结果也不对 static int count=0; public static void main(String[] args) { int[] a={10,1,5,3,2,6}...

package java程序员面试笔试宝典;public class 题8_5_19最小三元组距离 { public static void main(String[] args) { int[] a={3,4,5,7}; int[] b={10,12,14,16,17}; int[] c={20,21,23,24,27,30}; System.out.println(mi...

package java程序员面试笔试宝典;public class 题8_6_1实现字符串反转 { public static void main(String[] args) { String str="you are a man who are stupid"; reverseAll(str); } public static void reverseAll(String...

package java程序员面试笔试宝典;import java.util.Arrays;import java.util.HashMap;import java.util.Iterator;import java.util.Map;import java.util.Map.Entry;import java.util.Set;public class 题8_6_2字符串是否...

package java程序员面试笔试宝典;import java.util.List;import java.util.ArrayList;import java.util.HashSet;import java.util.Iterator;import java.util.Set;public class 题8_6_3删除字符串中重复的字符 { public static ...

package java程序员面试笔试宝典;public class 题8_6_4统计一行字符中有多少个单词 { public static void main(String[] args) { String s="I am a student named Peng Zhao"; wordCount(s); } public static void wordCount(Stri...

package java程序员面试笔试宝典;public class 题8_8_1消除嵌套的括号 { public static void main(String[] args) { String str="(1,(2,3),(4,(5,6),7))"; String str1="(1,(2,3),(4,(5,6),7))"; String str2=null; Strin...

package java程序员面试笔试宝典;public class 题8_8_2不使用比较运算符求两个数的最大值最小值 { public static void main(String[] args) { System.out.println(Integer.MAX_VALUE); System.out.println(getMin(214, 2147483647)); } ...

package java程序员面试笔试宝典;public class 题8_5_10递归方法求一个整数数组的最大元素 { public static void main(String[] args) { int[] a={17,0,16,2,3,4,5,10,7,8,9,18}; System.out.println(maxNum(a.length, a)); } public...

package java程序员面试笔试宝典;public class 题8_5_9找出数组中唯一重复元素 { public static void main(String[] args) { int[] a={1,2,2,3,5,4}; //int m=findOnlyEle_2(a); //System.out.println(Integer.toBinaryString(m...

package java程序员面试笔试宝典;import java.util.Stack;public class 题8_2_5两个栈模拟队列<E> { private Stack<E> st1=new Stack<E>(); private Stack<E> st2=new Stack<E>(); public sync...

package java程序员面试笔试宝典;public class 题8_4_1用移位操作实现乘法运算 { public static void main(String[] args) { System.out.println("3乘以2的2次方是"+" "+getPowerOf2N(3, 2)); System.out.println("5乘以2的3次方是"+" "+get...

package java程序员面试笔试宝典;public class 题8_4_2判断一个数是不是2的n次方 { public static void main(String[] args) { for (int i = 0; i < 10000; i++) { if(isPower2N1(i)){ System.out.print(i+" "); } ...

package java程序员面试笔试宝典;public class 题8_4_3二进制中1的个数 { public static void main(String[] args) { System.out.println(getNumberOf1(31)); } public static int getNumberOf1_1(int n){ int count=0; w...

package java程序员面试笔试宝典;public class 题8_5_1寻找数组中最小值与最大值 { public static void main(String[] args) { int[] a={7,2,9,0,14,20,2,16}; getMaxAndMin0(a); } public static void getMaxAndMin0(int[] a){...

package java程序员面试笔试宝典;public class 题8_5_2找出数组中第二大的数 { public static void main(String[] args) { int[] a={7,2,9,0,14,20,2,16}; getSecondMax(a); } public static int getSecondMax(int[] a){ int...

package java程序员面试笔试宝典;public class 题8_5_3求最大子数组之和 { //动态规划方式求最大数组入口没有解决，下次做 public static void main(String[] args) { int[] a={1,-2,4,8,-4,7,-1,-5}; getMaxSubArray_5(a); //System.out.println...

package java程序员面试笔试宝典;import java.util.Collections;import java.util.HashMap;import java.util.Map;import java.util.Map.Entry;import java.util.TreeMap;public class 题8_5_4数组中重复元素最多的数 { public s...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_5数组中两两相加等于20的组合种数 { public static void main(String[] args) { int[] a={1,7,17,2,6,3,14}; findSum_0(a); } public static void f...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_6数组循环右移k位 { public static void main(String[] args) { int[] a={1,2,3,4,5,6,7,8}; reverse_1(a,2); } //时间换空间 public static voi...

数组实现方法： package java程序员面试笔试宝典;import java.util.LinkedList;public class Queue<E>{ LinkedList<E> list=new LinkedList<E>(); public boolean isEmpty(){ return list.size()==0; ...

package java程序员面试笔试宝典;import java.util.LinkedList;import java.util.Queue;public class 两个队列模拟栈<E> { LinkedList<E> q1=new LinkedList<E>(); LinkedList<E> q2=new LinkedList...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_6数组循环右移k位 { public static void main(String[] args) { int[] a={1,2,3,4,5,6,7,8}; reverse_1(a,2); } //时间换空间 public static voi...

package java程序员面试笔试宝典;import java.util.Arrays;public class 题8_5_7数组第K个最小的数 { public static void main(String[] args) { int[] a={1,5,2,6,8,0,6}; quickSort(a, 0, a.length-1,7); } public stati...

package java程序员面试笔试宝典;public class 题8_5_8数组中只出现一次的数字{ public static void main(String[] args) { int[] a={1,2,2,1,3}; findOnce_0(a,2); } //全部移位操作，较好 public static int findOnce_0(int[] a,int n...

package java程序员面试笔试宝典;import java.util.LinkedList;import java.util.Queue;class TreeNode{ public int data; public TreeNode left; public TreeNode right; public TreeNode(int data){ this.data=...