亞信校招筆試題目

1、Company number :0089WT-8898YT-W8CCB-BUUT-202108public class BSTMinLength public static void main(String args) TreeNode tNodel 1 = new TreeNode(10, null, null);TreeNode tNodel2 = new TreeNode(50, null, null);TreeNode tNodel3 = new TreeNode(5, null, null);TreeNode tNodel4 = new TreeNode(30, null, null

2、);TreeNode tNode21 = new TreeNode(30, tNodel 1, tNodel2);TreeNode tNode22 = new TreeNode(30, tNodel3, tNodel4);TreeNode tNodeRoot = new TreeNode(100, tNode21, tNode22);private static int minlength(TreeNode tNode)if (tNode != null) return getlength(tNode50);return -1;private static int getlength(Tree

3、Node tNodeJnt curLength) int niinLeft=-l;int minRight=-l;if !=null)minLefi=getlength, curLength+;if !=null) minRight=getlength, curLength+;if =null & =niill) return curLength+;if =null) return minRight;if =null) return minLeft;return minLeftminRight minRight:minLeft;class TreeNode int value;TreeNode

4、 leftNode;TreeNode rightNode;TreeNode(int value, TreeNode lefeNode, TreeNode rightNode) =value;=lefeNode;=rightNode;#include using namespace std;int IruCountMiss(int max_cnch jsize, int *pages, int len)int count = 0;int ijXn;bool flag = false;int *a = new intmax_cache_size;轉鏈表Inode *reverse(lnode *h

5、ead)if(head)Inode *prev = NULL;Inode *curr = head;Inode *next = curr-next;curr-next = prev; while(next != NULL)prev = curr;curr = next;next 二 next-next;curr-next = prev;return curr;elsereturn head;；Inode *reverseLinkedList(lnode *list)if(list)Inode *ori = list;Inode *half = list;Inode *prev = list;w

6、hile(list & half & half-next)prev = list;list = list-next;half = half-next;if(half)half = half-next;if(list)prev-next = reverse(list);return ori;return list;4. SJFfloat waitingTimeSJF(int * requestTimes, int * durations,int n) int * flags = new intn;float sums = 0;for(int i = 0 ;i n; i+)flagsi =-l;i

7、nt nowtime = 0;for( int i = 0; i n; i+ )int count = 0;for(int k = 0; k n;k+)if(count = 0)if(requestTimesk =0 ) flagscount+ = k;elseif(durationsk =0 & requestTimesk = nowtime )if( durationsk durationsflags0) count = 1;flags0 = k;else if( durationsk = durationsflags0 ) flagscount+ = k;if(count = 0)cou

8、nt = 1;for(int j = 0; j=0 ) flags0 = j; nowtime = requestTimes|j;1int idx = flagsOJ;int minreq = requestTinies flagsfO;int niindrus = durationsidx;if(count 1)for(int j = 1; j count ;j+) if(requestTimesflagsj minreq ) minreq =requestTimesflagsj; idx = flagsj;sums += nowtime - requestTimesidx;nowtime

9、+= durationsidx;requestTimesidx = -1; durationsidx = -1;return sums/n;5無向連通判斷是否為樹#include#include#includeconst int N= 10000, M= 100000;bool edgeNN;老鼠奶酪#include using namespace std;int isPath(int *grid, int m, int n);struct _TraversedNodeint x;int y;_TraversedNode *next;struct _Nodeint x;int y;int ma

10、in(int argc, const char * argv)int *grid= new int*8;for(int i=0;i&i+)gridi= new int8;)grid00=l; grid0l=l; grid02=0; grid03=0; grid04=0; grid05=0;0=0; grid07=l; gridl0=l;gridll=l;gndl2=l;gridl3=l;gridl4=l;gridl5=l;grid1 =l;gridl7=l;grid0=l;grid2l=0; grid22=0; grid2=0; grid24=l; grid25=0; grid2 =0; gr

11、id27=l;grid30=l; grid3l=l; grid32=l; grid33=O; grid4=1; grid3=0; grid3 =0; grid37=l;grid40=0; grid4l=l;grid42=0; grid43=0; grid44=l; grid45=l; grid4 =l;grid47=l;grid0=0; grid5l=l;grid52=O; grid53=0; grid4=0; grid55=O;grid5 =0; grid57=l;grid60=0; grid6l=l;grid62=0; grid6=9; grid4=1; grid=1; grid6 6=l

12、;grid 67=1;grid70=0; grid7l=l; grid72=l; grid=1; grid74=0; grid75=0; grid7 6=1; grid77=0;for(int i=0:ix=0;TraversedNode-y=0;head=TraversedNode;p=TraversedNode;p-next=NULL;int count_node=0:int nuni_node=l;_Node *node=new _Noden+m;_Node *node_next=new _Noden+m;node0.x=0;node0.y=0;while(l)for(int i=0;i

13、num_node;i+)if(nodei.x+1 x=nodei .x+1)&(p_check-y=nodei.y)p_check 二 NULL;flag_down_success二false;elsep_check=p_check-next;if(flag_down_success)TraversedNode=new _TraversedNode;TraversedNode-x=nodei.x+l;T raversedNode-y=node i.y; p-next=TraversedNode;p=TraversedNode;p-next=NULL;node_nextcount_node.x=

14、nodei.x+l;node_nextcount_node.y=nodei.y;count_node+;flag_dowivsuccess=true;)if(nodei .x-1 =0)if(gridnodei.x-1 nodei .y !=0)if(gridnodei .x-1 nodei .y=9)step+;cout可以最短 vvstepvv步到達終點endl; return 1;1p_check 二 head;while(p_check!二 NULL)if(p_check-x=nodei .x-1)&(p_check-y=nodei.y) p_check 二 NULL;flag_up_

15、success 二 false;elsep_check=p_check-next;if(flag_up_success)TraversedNode=new _TraversedNode;T ra versedNode-x=node i . x-1;T raversedNode-y=node i.y;p-next=TraversedNode;p=TraversedNode;p-next=NULL;node_nextcount_node.x=nodei.x-l;node_nextcount_node.y=nodei.y;count_node+;flag_up_success=true;)if(no

16、dei.y+1 x=nodei .x)&(p_check-y=nodei .y+1) p_check 二 NULL;flag_right_success=false;elsep_check=p_check-next;if(flag_right_success)TraversedNode=new _TraversedNode;T raversedNode-x=node i.x;TraversedNode-y=nodei.y+l; p-next=TraversedNode;p=TraversedNode; p-next=NULL;node_nextcount_node.x=nodei.x; nod

17、e_nextcount_node.y=nodei.y+l; count_node+;flag_right_success=tnje;)if(nodei .y-1 =0)if(gridnodei.xnodei.y-l!=0)if(gridnodei.xnodei.y-l=9)step+;cout可以最短 vvstepvv步到達終點endl;return 1;1p_check 二 head;while(p_check!二 NULL)if(p_check-x=nodei .x)&(p_check-y=nodei .y-1) p_check 二 NULL;flag_left_success二false

18、;elsep_check=p_check-next;if(flag_left_success)TraversedNode=new _TraversedNode; T raversedNode-x=node i.x;TraversedNode-y=nodei.y-l; p-next=TraversedNode; p=TraversedNode;p-next=NULL;node_nextcount_node.x=nodei.x; node_nextcount_node.y=nodei.y-l; count_node+;flag_left_success 二 true;)if(count_node=

19、0)coutvv不存在到達終點的路徑endl; return 0;break;step+;num_node=cou nt_node;count_node=0; for(int i=0;inum_node;i+)nodei .x=node_nexti .x;nodei.y=node_nexti.y; cout,(nodei.x,；,nodei.y,)coutendl;17 格雷碼publicstaticintgray(byteterm 1 ,byteterm2) intn=0;for(inti=0;i&i+)(u = l)J!(u JUlUIJjXlU piOA ipjs ooudsouiuu

20、uisn opn(oin#()juud ino mejsAs :令男岡宙皐皆目翌皇怎龜蟲至轄士 ( wand)聊弄毛書熬R姿菜凹羽溫峻別辜耳牡，矽眛“盼，m箒皐總砂號。由耳滌曲號馬，竺厚T噸誤爭 ridaWuiJd ino LUSisAsfe 忌図回王?回宴壬宜獨、&蚩立 (00L=u=0S! ujeuBdiunizsdejc ujgedtunizedej丄TTQTCTZTg 9SGJ竝導S9/ 0Z沖6t 半2 T乓琳麗甘関辱D=u畜序8 ：QUJnj3J asp : ujnpj (l=u)J!:仃 uu3j)(ojXq)=：乙 iiuq) 乂 I vv l ui.iaj)(ojXq)= 1

21、112) t+u(M3=(vl)JT 乙1112匸乙) ：ip 聶 liug=H 訂()xo(wq)二 ip tqotlPjXq cout H1*2H endl; return;)int last number = n*(n+I);序循環(huán)鏈表插入整數(shù)#include#include#define N 5typedef struct node int data;struct node * next;SN;SN * creatlink (int a)符串格式化，去掉首尾的空格，以及字符串中間連續(xù)的空格，但中間的只保存最后一個空格。比方：i love meituan ，格式化后：ilove meituan.我說一下我的思路：1.用string的substring方法很輕松去掉首尾的空格。2, 將去掉首尾空格的字符串轉化為一個字符數(shù)組，方便對空格的查找。3, 將找到的空格的下標記錄在一個arrayList (長度可變的優(yōu)點等)中去。4, 將第1步驟得到的字符串進行切割，最后一個空格前的字符串作為 前綴字符串將(包括最后一個空格的下標)從最后一個下標開始到字符串結尾作為后綴字符