1、试题一：输入字符串长度len1，字符串s1，字符串长度len2，字符串s2 。从后向前比较，以最短字符串为标准，输出不同的元素的个数。例如: 输入：s1=“1,3,5“ len1=3 s2=“2,4,1,7,5“ len2=5输出：1public class Test1 public static void main(String args) String str1 = “1,3,5“;String str2 = “2,1,6,5“;System.out.println(getDifferentNumber(str1, 3, str2, 4);public static int getDiff
2、erentNumber(String str1, int len1, String str2, int len2)int count = 0;int len = 0;len = (len1=obj.length)resize();objsize+ = data;return true;public Object pop()if(size = 0)return null;return obj-size;实例应用1：将10进制的正整数转换为 n进制public String conversion(int num,int n)MyStack ms = new MyStack();Integer re
3、s = num;while(true)ms.push(res%n);res = res/n;if(res = 0)break;StringBuffer sb =new StringBuffer();while(res=(Integer) ms.pop()!=null)sb.append(res);return sb.toString();实例应用2：判断括号的匹配public boolean isMatch(String str) MyStack myStack = new MyArrayStack();char arr = str.toCharArray();for (char c : ar
4、r) Character temp = myStack.pop();/ 栈为空时只将c入栈if (temp = null) myStack.push(c);/ 配对时c不入栈else if (temp = myStack.push(c);return myStack.isEmpty();/链表实现public class MyLinkedStack private LinkedNode top;private int size;public MyLinkedStack()top = null;size = 0;public boolean isEmpty()return size = 0;pu
5、blic void clear()top = null;size = 0;public int length()return size;public boolean push(Object o)LinkedNode ln = new LinkedNode();ln.data = o;ln.pre = top;top = ln;size+;return true;public Object pop()if(top != null)LinkedNode ln = top;top = top.pre;size-;return ln.data;return null;class LinkedNodep
6、ublic Object data;public LinkedNode pre;试题五：简单四则运算public class Operate public static void main(String args) String exp = “1+3*4+6/2“;System.out.println(calculate(exp);public static int calculate(String exp)char exps = exp.toCharArray();int num = new int20;int str = new int20;int k2;int k1 = k2 = 0;f
7、or(int i=0;i=0for(int i=0;iaj)tmp = ai;ai = aj;aj = tmp;int k = 0;for(int i=0;i= 50且 sys_List = new ArrayList();List usr_List = new ArrayList();for(int i=0;itaski)sys_List.add(indexi);else if(taski=50elsebig.append(tmpchi);char chsmal = small.toString().toCharArray();char chbig = big.toString().toCh
8、arArray();for(int i=0;ichsmal.length;i+)char tmp = ;for(int j=i+1;jchsmal.length;j+)if(chsmaljchsmali)tmp = chsmalj;chsmalj = chsmali;chsmali = tmp;for(int i=0;ichbig.length;i+)char tmp = ;for(int j=i+1;jchbig.length;j+)if(chbigjchbigi)tmp = chbigj;chbigj = chbigi;chbigi = tmp;/Arrays.sort(chsmal);char total = new charsb.length();for(int i=0;ichsmal.length;i+)totali = chsmali;for(int i=0;ichbig.length;i+)totalchsmal.length+i = chbigi;return String.valueOf(total);
