交通計算機考研復(fù)試

reverseofthissequence.Yourtaskistowriteaprogramthatprints plexitytranspositionofthegivensequence.Youaregivenanunsortedarrayofintegernumbers.Yourtaskistosortthisarrayandkillpossibleduplicatedelementsoccurringinit.FindalongestcommonsubsequenceoftwoWenowusetheGregorianstyleofdatinginRussia.Theleapyearsareyearswithnumberdivisibleby4butnotdivisibleby100,ordivisibleby400.Forexample,years2004,2180and2400areleap.Years2004,2181and2300arenotleap.Yourtaskistowriteaprogramwhichwillcomputethedayofweekcorrespondingtoagivendateinthenearestpastorinthefutureusingtoday’sagreementaboutdating.Weareallfamiliarwithpre-order,in-orderandpost-ordertraversalsofbinarytrees.Acommonproblemindatastructureclassesistofindthepre-ordertraversalofabinarytreewhengiventhein-orderandpost-ordertraversals.Alternatively,youcanfindthepost-ordertraversalwhengiventhein-orderandpre-order.However,ingeneralyoucannotdeterminethein-ordertraversalofatreewhengivenitspre-orderandpost-ordertraversals.Considerthefourbinarytreesbelow: Allofthesetreeshavethesamepre-orderandpost-ordertraversals.Thisphenomenonisnotrestrictedtobinarytrees,butholdsforgeneralm-arytreesaswell.12翻下是21,34翻下是43,12 ,46翻下是64，現(xiàn)在?任意兩個正整數(shù)，問他們兩個數(shù)反轉(zhuǎn)?錄下?，并???錄向右縮格，就像這樣：ab cd ebcstd同級的需要按字?順序排列，不有個6*6的棋盤，每個棋盤上都有個數(shù)值，現(xiàn)在?個起始位置和終?位置，請找出個從起始位 2、總代價是沒?步的代價之和 每?步，狀態(tài) TheFibonacciNumbers{0,1,1,2,3,5,8,13,21,34,55...}aredefinedbytherecurrence: WriteaprogramtocalculatetheFibonacciNumbers.Acommontyerroristocethehandsonthekeyboardonerowtotherightofthecorrectposition.So"Q"istypedas"W"and"J"istypedas"K"andsoon.Youaretodecodeamessagetypedinthismanner.Findingalloccurrencesofapatterninatextisaproblemthatarisesfrequentlyintext- Typically,thetextisa beingedited,andthepatternsearchedforisaparticularworddbytheuser. WeassumethatthetextisanarrayT[1..n]oflengthnandthatthepatternisanarrayP[1..m]oflengthm<=n.WefurtherassumethattheelementsofPandTareallalphabets(∑={a,b...,z}).ThecharacterarraysPandTareoftencalledstringsofcharacters. WesaythatpatternPoccurswithshiftsinthetextTif0<=s<=nandT[s+1..s+m]=P[1..m](thatisifT[s+j]=P[j],for1<=j<=m). PoccurswithshiftsinT,thenwecallsavalidshift;otherwise,wecallsainvalidshift. YourtaskistocalculatethenumberofvaldshiftsforthegiventextTandpatternP.Everypositivenumbercanbepresentedbytheexponentialform.Forexample,137=2^7+2^3+2^0。Let'spresenta^bbytheforma(b).Then137ispresentedby2(7)+2(3)+2(0).Since7=2^2+2+2^0and3=2+2^0,137isfinallypresentedby2(2(2)+2+2(0))+2(2+2(0))+2(0). Givenapositivenumbern,yourtaskistopresentnwiththeexponentialformwhichonlycontainsthedigits0and2.存在兩組數(shù)組，和4個數(shù)字a,b,c,d,要求做如下操作，將第個數(shù)組第a個數(shù)到第b個數(shù)，第?個數(shù)組的第c個數(shù)到第d個數(shù)放到個