题目一：publicclasstestClockwiseOutput{//顺时针打印一个矩阵@Testpublicvoidtest(){int[][]num=newint[100][100];intn=4;intcount=1;for(inti=0;i=end||end<=0)return;for(inti=start;i<=end;i++){System.out.println(num[start][i]);}for(inti=start+1;i<=end;i++){System.out.println(num[i][end]);}for(inti=end-1;i>=start;i--){System.out.println(num[end][i]);}for(inti=end-1;i>start;i--){System.out.println(num[i][start]);}output(num,start+1,end-1);}}题目2：给定一个排序数组和一个数，找到数组中连续元素之和等于给定数的子数组//giveasortedarrayAndanumber,找到数组中连续元素之和等于给定数的子数组@Testpublicvoidtest(){int[]num={1,2,2,3,4,5,6,7,8,9};intsum=7;findSum(num,sum);}publicvoidfindSum(int[]num,intsum){intleft=0;intright=0;for(inti=0;i=length-1){print(cs);return;}for(inti=start;itemp2){returntrue;}else{returnfalse;}}题目五：//子电影***和@Testpublicvoidtest(){int[]num={1,-2,3,10,-4,7,2,-5};//int[]num={1,-2,3,10,-4,10,2,-5};System.out.println(maxSum(num));}publicintmaxSum(int[]num){intcurSum=0;intcurMaxSum=-99999999;intstart=0;intend=0;for(inti=0;icurMaxSum){curMaxSum=curSum;end=i;}}for(inti=start;i<=end;i++){System.out.println(num[i]);}returncurMaxSum;}题目六：publicclasstestMinStack{//自定义栈，min函数获取当前最小值@Testpublicvoidtest(){MinStackms=newMinStack();ms.push(5);System.out.println(ms.min());ms.push(6);ms.push(2);ms.push(1);System.out.println(ms.min());ms.pop();System.out.println(ms.min());ms.pop();System.out.println(ms.min());}}classMinStack{privateStackminStack=newStack();privateStackstack=newStack();publicintpop(){minStack.pop();returnstack.pop();}publicvoidpush(intnum){if(minStack.size()<=0){minStack.push(num);return;}Integermin=minStack.lastElement();if(nums1=newStack();Stacks2=newStack();for(inti=0;i<5;i++){s2.push(num2[i]);}System.out.println(testOrder(num,s1,s2));}publicbooleantestOrder(int[]num,Stacks1,Stacks2){intlength=num.length;for(inti=0;i1)returnfalse;count+=pai[i];}if(count==5)returntrue;elsereturnfalse;}publicvoidqsort(int[]num,intleft,intright){if(left=partition){right--;}swap(num,left,right);while(left
