HashingforMachineLearning（用于机器学习特征工程的哈希），微软研究院JohnLongford的讲义。

RobertSedgewickhasthoroughlyrewrittenandsubstantiallyexpandedandupdatedhispopularworktoprovidecurrentandcomprehensivecoverageofimportantalgorithmsanddatastructures.ChristopherVanWykandSedgewickhavedevelopednewC++implementationsthatbothexpressthemethodsinaconciseanddirectmanner,andalsoprovideprogrammerswiththepracticalmeanstotestthemonrealapplications.Manynewalgorithmsarepresented,andtheexplanationsofeachalgorithmaremuchmoredetailedthaninpreviouseditions.Anewtextdesignanddetailed,innovativefigures,withaccompanyingcommentary,greatlyenhancethepresentation.ThethirdeditionretainsthesuccessfulblendoftheoryandpracticethathasmadeSedgewick'sworkaninvaluableresourceformorethan250,000programmers!Thisparticularbook,Parts1n4,representstheessentialfirsthalfofSedgewick'scompletework.Itprovidesextensivecoverageoffundamentaldatastructuresandalgorithmsforsorting,searching,andrelatedapplications.Althoughthesubstanceofthebookappliestoprogramminginanylanguage,theimplementationsbyVanWykandSedgewickalsoexploitthenaturalmatchbetweenC++classesandADTimplementations.Highlights*Expandedcoverageofarrays,linkedlists,strings,trees,andotherbasicdatastructures*Greateremphasisonabstractdatatypes(ADTs),modularprogramming,object-orientedprogramming,andC++classesthaninpreviouseditions*Over100algorithmsforsorting,selection,priorityqueueADTimplementations,andsymboltableADT(searching)implementations*Newimplementationsofbinomialqueues,multiwayradixsorting,randomizedBSTs,splaytrees,skiplists,multiwaytries,Btrees,extendiblehashing,andmuchmore*Increasedquantitativeinformationaboutthealgorithms,givingyouabasisforcomparingthem*Over1000newexercisestohelpyoulearnthepropertiesofalgorithmsWhetheryouarelearningthealgorithmsforthefirsttimeorwishtohaveup-to-datereferencematerialthatincorporatesnewprogrammingstyleswithclassicandnewalgorithms,youwillfindawealthofusefulinformationinthisbook.

课程大纲每节课资料提前5天发放第1章本节大纲”破解“算法面试"Hack"theAlgorithmInterview算法面试究竟考什么史上最全的算法面试考点大全2013-2018面试难度变化如何在最有效率的准备算法面试如何在不押题的情况下更有信息的去面试2018/6/24上午9:30:00第2章本节大纲二分与LogN算法BinarySearch&LogNAlgorithm二分法三重境界二分位置之满足条件的第一次-BinarySearchonIndex-OOXX二分位置之保留一半-BinarSearchonIndex-Halfhalf二分答案-BinarySearchonResult学习BinarySearch的通用模板，不再死循环讲解SearchinRotatedSortedArray等10道高频二分搜索题2018/7/1上午9:30:00第3章本节大纲为面试而生的双指针算法TwoPointersAlgorithmTwoSum问题及他的各种扩展TwoSum&Follow-ups其他高频的双指针问题2018/7/2上午9:30:00第4章本节大纲宽度优先搜索和拓扑排序BFS&TopologicalSorting二叉树上的宽搜BFSinBinaryTree二叉树的序列化问题BinaryTreeSerialization图上的宽搜BFSinGraph拓扑排序TopologicalSorting棋盘上的宽搜BFSinChessboard2018/7/15上午9:30:00第5章本节大纲基于树的深度优先搜索Tree-basedDFS二叉树的深度优先遍历BinaryTreeDFSTraversal先序/中序/后序Preorder/inorder/postorder二叉树中的分治算法Divide&ConquerDFS模板IntroduceDFSTemplate二叉树高频面试问题递归三要素遍历算法与分治算法对比TraversevsDivideConquer2018/7/16上午9:30:00第6章本节大纲基于组合的深度优先搜索Combination-basedDFS组合类深搜CombinationDFS排列类深搜PermutationDFS图上的深搜GraphDFS非递归的深搜实现方法Non-Recursion2018/7/22上午9:30:00第7章本节大纲基于排列、图的深度优先搜索Permutation/GraphbasedDFSTBD2018/7/23上午9:30:00第8章本节大纲数据结构-栈，队列，哈希表与堆Stack,Queue,Hash&Heap哈希表Hash常用的哈希库的区别HashSetvsHashMapvsHashTable哈希表的实现原理BasicHashKnowledge哈希函数HashFunction冲突的解决方法Collision开散列OpenHashing闭散列ClosedHashing哈希扩容Rehashing哈希表高频面试题HighFrequentlyAskedHashQuestions堆堆的基本原理BasicHeapKnowledge优先队列与堆的联系和区别PriorityQueuevsHeap堆的高频面试题HighFrequentlyAskedHeapQuestions堆的代替品：TreeMap2018/7/29上午9:30:00第9章本节大纲数据结构-区间、数组、矩阵与树状数组Interval,Array,Matrix&BinaryIndexedTree数组Array子数组及相关面试题Subarray&RelatedQuestions其他高频数组问题HighFrequentAskedArrayQuestionsTBD2018/7/30上午9:30:00课程更新日志

WhatthisbookcoversChapter1,HelloRust!,givesashortrecapoftheRustprogra妹妹inglanguageandwhatchangedinthe2018edition.Chapter2,CargoandCrates,discussesRust'scargobuildtool.Wewillexploretheconfigurationaswellasthebuildprocessandmodularizationoptions.Chapter3,StoringEfficiently,looksathowinRust,knowingwherevaluesarestoredisnotonlyimportantforperformance,butalsoimportantforunderstandingerrormessagesandthelanguageingeneral.Inthischapter,wethinkaboutstackandheapmemory.Chapter4,Lists,Lists,andMoreLists,coversthefirstdatastructures:lists.Usingseveralexamples,thischaptergoesintovariationsofsequentialdatastructuresandtheirimplementations.Chapter5,RobustTrees,continuesourjourneythroughpopulardatastructures:treesarenextonthelist.Inseveraldetailedexamples,weexploretheinnerworkingsoftheseefficientdesignsandhowtheyimproveapplicationperformanceconsiderably.Chapter6,ExploringMapsandSets,exploresthemostpopularkey-valuestores:maps.Inthischapter,techniquessurroundinghashmaps;hashing;andtheircloserelative,theset;aredescribedindetail.Chapter7,CollectionsinRust,attemptstoconnecttotheRustprogra妹妹er'sdailylife,goingintothedetailsoftheRuststd::collectionslibrary,whichcontainsthevariousdatastructuresprovidedbytheRuststandardlibrary.Chapter8,AlgorithmEvaluation,teachesyouhowtoevaluateandcomparealgorithms.Chapter9,OrderingThings,willlookatsortingvalues,animportanttaskinprogra妹妹ing—thischapteruncovershowthatcanbedonequicklyandsafely.Chapter10,FindingStuff,movesontosearching,whichisespeciallyimportantifthereisnofundamentaldatastructuretosupportit.Inthesecases,weusealgorithmstobeabletoquicklyfindwhatwearelookingfor.Chapter11,RandomandCombinatorial,iswherewewillseethat,outsideofsortingandsearching,

Thisbookintroducesyoutotheworldofdatastructuresandalgorithms.Datastructuredefinesthewaydataisarrangedincomputermemoryforfastandefficientaccesswhilealgorithmisasetofinstructiontosolveproblemsbymanipulatingthesedatastructures.DataStructuresalgorithmsInGoHemantjainCopyrightoHemantJain2017.AllRightReservedHemantJainassertsthemoralrighttobeidentifiedasheauthorofthisworkAllrightsreserved.Nopartofthispublicationmaybereproduced,storedinorintroducedintoaretrievalsystem,ortransmitted,inanyform,orbyanymeans(electrical,mechanical,photocopying,recordingorotherwise)withoutthepriorwrittenpermissionoftheauthor,exceptinthecaseofverybriefquotationsembodiedincriticalreviewsandcertainothernonco妹妹ercialusespermittedbycopyrightlaw.AnypersonwhodoesanyunauthorizedactinrelationtothispublicationmaybeliabletocriminalprosecutionandcivilclaimsfordamagesACKNOWLEDGEMENTTheauthorisverygratefultoGodALMIGhTYforhisgraceandblessingDeepestgratitudeforthehelpandsupportofmybrotherDrSumantJain.ThisbookwouldnothavebeenpossiblewithoutthesupportandencouragementheprovidedIwouldliketoexpressprofoundgratitudetomyguide/myfriendNaveenKaushikforhisinvaluableencouragement,supervisionandusefulsuggestionthroughoutthisbookwritingwork.hissupportandcontinuousguidanceenablemetocompletemyworksuccessfuFinallyyetimportantly,IamthankfultoLoveSinghal,AnilberryandotherswhohelpedmedirectlyorindirectlyincompletingthisbookHemantJainTABLEOFCONTENTSACKNOWLEDGEMENTTABLEOFCONTENTSChAPTERO:HOWTOUSETHISBOOKWHATTHISBOOKISABOUTPREPARATIONPLANSSUMMARYChAPTER1:NTRODUCTION-PROGRAMMIINGOVERVIEWINTRODUCTIONFIRSTGOPROGRAMvariablesconstantsBASICDATATYPESSTRINGCONDITIONSANDLOOPSFUNCTIONPARAMETERPASSINGCALLBYVALUEPOINTERSPARAMETERPASSING.CALLBYPOINTER/REFERENCESTRUCTURESMETHODSINTERFACEARRaySLICEMAP/DICTIONARYARRAYINTERVIEWQUESTIONSCONCEPTOFSTACKSYSTEMSTACKANDMETHODCALLSRECURSIVEFUNCTIONEXERCISESCHAPTER2:ALGORITHMSANALYSISINTRODUCTIONALGORITHMASYMPTOTICANALYSISBIG-ONOTATIONOMEGA-QNOTATIONTHETA-⊙NOTATIONCOMPLEXITYANALYSISOFALGORITHMSTIMECOMPLEXITYORDERDERIVINGTHERUNTIMEFUNCTIONOFANALGORITHMTIMECOMPLEXITYEXAMPLESMASTERTHEOREMMODIFIEDMASTERTHEOREMEXERCISECHAPTER3:APPROACHTOSOLVEALGORITHMDESIGNPROBLEMSINTRODUCTIONCONSTRAINTSIDEAGENERATIONCOMPLEXITIESCODINGTESTINGEⅹAMPLESUMMARYChaPTER4:ABSTRACTDATATYPEGOCollECtIonsABSTRACTDATATYPE(ADTDATA-STRUCTUREGOCOLLECTIONFRAMEWORKACKQUEUETREEBINARYTREEBINARYSEARCHTREES(BSTPRIORITYQUEUE(HEAPHASH-TABLEDICTIONARY/SYMBOLTABLEGRAPHSGRAPHALGORITHMSSORTINGALGORITHMSCOUNTINGSORTENDNOTEchaPTER5:SEARCHINGINTRODUCTIONWHYSEARCHING?DIFFERENTSEARCHINGALGORITHMSLINEARSEARCH-UNSORTEDINPUTLINEARSEARCH-SORTEDBINARYSEARCHSTRINGSEARCHINGALGORITHMSHASHINGANDSYMBOLTABLESHOWSORTINGISUSEFULINSELECTIONALGORITHM?PROBLEMSINSEARCHINGEXERCISECHAPTER6:SORTINGINTRODUCTIONTYPEOFSORTINGBUBBLE-SORTMODIFIED(IMPROVED)BUBBLE-SORTINSERTION-SORTSELECTION-SORTMERGE-SORTQUICK-SORTQUICKSELECTBUCKETSORTGENERALIZEDBUCKETSORTHEAP-SORTTREESORTINGEXTERNALSORT(EXTERNALMERGE-SORTICOMPARISONSOFTHEVARIOUSSORTINGALGORITHMSSELECTIONOFBESTSORTINGALGORITHMEXERCISEChAPTER7:LINKEDLISTINTRODUCTIONLINKEDLISTTYPESOFLINKEDLISTSINGLYLINKEDLISTDOUBLYLINKEDLISTCIRCULARLINKEDLISTDOUBLYCIRCULARLISTEXERCISEchapter8:STACKINTRODUCTIONTHESTACKABSTRACTDATATYPESTACKUSINGSLICESSTACKGENERICIMPLEMENTATIONSTACKUSINGLINKEDLISTPROBLEMSINSTACKUSESOFSTACKEXERCISEchaPTER9:QUEUEINTRODUCTIONTHEQUEUEABSTRACTDATATYPEQUEUEUSINGLISTQUEUEUSINGLINKEDLISTPROBLEMSINQUEUEEXERCISECHAPTER10:TREEINTRODUCTIONTERMINOLOGYINTREEBINARYTREETYPESOFBINARYTREESPROBLEMSINBINARYTREEBINARYSEARCHTREE(BST)PROBLEMSINBINARYSEARCHTREE(BSTISEGMENTTREEAVLTREESRED-BLACKTREESPLAYTREEB-TREEB+TREEB*TREEEXERCISECHAPTERIl:PRIORITYQUEUEINTRODUCTIONTYPESOFHEAPHEAPADTOPERATIONSOPERATIONONHEAPHEAP-SORTUSESOFHEAPPROBLEMSINHEAPPRIORITYQUEUEGENERICIMPLEMENTATION.PRIORITYQUEUEUSINGHEAPFROMCONTAINER.EXERCISECHAPTER12:HASH-TABLEINTRODUCTIONHASH-TABLEHASHIINGWITHOPENADDRESSINGHASHINGWITHSEPARATECHAININGPROBLEMSINHASHINGEXERCISEChaPTER13:GRAPHSINTRODUCTIONGRAPHREPRESENTATIONADJACENCYMATRIXADJACENCYLISTGRAPHTRAVERSALSDEPTHFIRSTTRAVERSALBREADTHFIRSTTRAVERSALPROBLEMSINGRAPHDIRECTEDACYCLICGRAPHTOPOLOGICALSORTMINIMUMSPANNINGTREES(MST)SHORTESTPATHALGORITHMSINGRAPHEXERCISEChAPTER14:STRINGALGORITHMSTRODUCTIONSTRINGMATCHINGDICTIONARY/SYMBOLTABLEPROBLEMSINSTRINGEXERCISECHAPTER15:ALGORITHMDESIGNTECHNIQUESNTRODUCTIONBRUTEFORCEALGORITHMGREEDYALGORITHMDIVIDE-AND-CONQUER,DECREASE-AND-CONQUERDYNAMICPROGRAMMINGREDUCTIONTRANSFORM-AND-CONQUERBACKTRACKINGBRANCH-AND-BOUNDAALGORITHMCONCLUSIONCHAPTER16:BRUTEFORCEALGORITHMINTRODUCTIONPROBLEMSINBRUTEFORCEALGORITHMCONCLUSIONCHAPTER17:GREEDYALGORITHMINTRODUCTIONPROBLEMSONGREEDYALGORITHMCHAPTER18:DIVIDE-AND-CONQUER,DECREASE-AND-CONQUER

IsotropicHashing,一种基于ITQ改进的Hash算法，结果要优于ITQ。

（含源码及报告）本程序分析了自2016年到2021年（外加）每年我国原油加工的产量，并且分析了2020年全国各地区原油加工量等，含饼状图，柱状图，折线图，数据在地图上显示。
运转本程序需要requests、bs4、csv、pandas、matplotlib、pyecharts库的支持，如果缺少某库请自行安装后再运转。
文件含6个excel表，若干个csv文件以及一个名字为render的html文件（需要用浏览器打开），直观的数据处理部分是图片以及html文件，可在地图中显示，数据处理的是excel文件。
不懂可以扫文件中二维码在QQ里面问。

在日常工作中，钉钉打卡成了我生活中不可或缺的一部分。然而，有时候这个看似简单的任务却给我带来了不少烦恼。 每天早晚，我总是得牢记打开钉钉应用，点击"工作台"，再找到"考勤打卡"进行签到。有时候因为工作忙碌，会忘记打卡，导致考勤异常，影响当月的工作评价。而且，由于我使用的是苹果手机，有时候系统更新后，钉钉的某些功能会出现异常，使得打卡变得更加麻烦。 另外，我的家人使用的是安卓手机，他们也经常抱怨钉钉打卡的繁琐。尤其是对于那些不太熟悉手机操作的长辈来说，每次打卡都是一次挑战。他们总是担心自己会操作失误，导致打卡失败。 为了解决这些烦恼，我开始思考是否可以通过编写一个全自动化脚本来实现钉钉打卡。经过一段时间的摸索和学习，我终于成功编写出了一个适用于苹果和安卓系统的钉钉打卡脚本。