offer_code

我针对剑指offer的C++代码可能与剑指offer作者给出的代码有部分不一样，根据自己思路写的，大体思路还是差不多的，只是可能具体的实现略微不同。

Name		Name	Last commit message	Last commit date
ComputeExcuteTime.cpp		ComputeExcuteTime.cpp
README.md		README.md
q1.cpp		q1.cpp
q10_fibonacci.cpp		q10_fibonacci.cpp
q10_frogJump.cpp		q10_frogJump.cpp
q11_rotaArr.cpp		q11_rotaArr.cpp
q12_pathMatrix.cpp		q12_pathMatrix.cpp
q13_robotMove.cpp		q13_robotMove.cpp
q14_cutRope.cpp		q14_cutRope.cpp
q15_numof1.cpp		q15_numof1.cpp
q16_pow.cpp		q16_pow.cpp
q17_1ToNbit.cpp		q17_1ToNbit.cpp
q18_deleteRepeatNode.cpp		q18_deleteRepeatNode.cpp
q18deleteListNode.cpp		q18deleteListNode.cpp
q19_regxMatch.cpp		q19_regxMatch.cpp
q20_isNumber.cpp		q20_isNumber.cpp
q21_adjustNum.cpp		q21_adjustNum.cpp
q22_last_K.cpp		q22_last_K.cpp
q23_entryOfCycleList.cpp		q23_entryOfCycleList.cpp
q24_reverseList.cpp		q24_reverseList.cpp
q25_mergeSortList.cpp		q25_mergeSortList.cpp
q26_subTree.cpp		q26_subTree.cpp
q27_mirrorImage.cpp		q27_mirrorImage.cpp
q28_isMirror.cpp		q28_isMirror.cpp
q29_printMatrix.cpp		q29_printMatrix.cpp
q3.cpp		q3.cpp
q30_minStack.cpp		q30_minStack.cpp
q31_stackPopSeq.cpp		q31_stackPopSeq.cpp
q32_1_printTreeLine.cpp		q32_1_printTreeLine.cpp
q32_2_printTreeLine.cpp		q32_2_printTreeLine.cpp
q32_printTreeFormTop.cpp		q32_printTreeFormTop.cpp
q33_postOrderTree.cpp		q33_postOrderTree.cpp
q34_pathSum.cpp		q34_pathSum.cpp
q35_ComplexListCopy.cpp		q35_ComplexListCopy.cpp
q36_TreeToList.cpp		q36_TreeToList.cpp
q37_Serialize.cpp		q37_Serialize.cpp
q38_permutation.cpp		q38_permutation.cpp
q39_moreThanHalf.cpp		q39_moreThanHalf.cpp
q3_1.cpp		q3_1.cpp
q3_repeatNum.cpp		q3_repeatNum.cpp
q4.cpp		q4.cpp
q40_Minmumk.cpp		q40_Minmumk.cpp
q41_mediumDataFlow.cpp		q41_mediumDataFlow.cpp
q42_maxSubSum.cpp		q42_maxSubSum.cpp
q43_timeOf1.cpp		q43_timeOf1.cpp
q44_numOfSeq.cpp		q44_numOfSeq.cpp
q45_sortArrayToMin.cpp		q45_sortArrayToMin.cpp
q46_decodeWay.cpp		q46_decodeWay.cpp
q47_maxGift.cpp		q47_maxGift.cpp
q48_maxSubStr.cpp		q48_maxSubStr.cpp
q49_uglyNum.cpp		q49_uglyNum.cpp
q4_findNumInMatrix.cpp		q4_findNumInMatrix.cpp
q5.cpp		q5.cpp
q50_FirstAppearOnce.cpp		q50_FirstAppearOnce.cpp
q50_FirstApperInstream.cpp		q50_FirstApperInstream.cpp
q51_reversePair.cpp		q51_reversePair.cpp
q52_firstCommonNode.cpp		q52_firstCommonNode.cpp
q53_02_findLostNum.cpp		q53_02_findLostNum.cpp
q53_03_indexEqualNum.cpp		q53_03_indexEqualNum.cpp
q53_findRepeatTime.cpp		q53_findRepeatTime.cpp
q54_kthInTree.cpp		q54_kthInTree.cpp
q55_02_balanceTree.cpp		q55_02_balanceTree.cpp
q55_depthOfTree.cpp		q55_depthOfTree.cpp
q56_01_appearOnce.cpp		q56_01_appearOnce.cpp
q56_02_appearOnceOtherIsSThree.cpp		q56_02_appearOnceOtherIsSThree.cpp
q57_02_sumOfSeq.cpp		q57_02_sumOfSeq.cpp
q57_SumOfTarget.cpp		q57_SumOfTarget.cpp
q58_leftRoatString.cpp		q58_leftRoatString.cpp
q58_reverseString.cpp		q58_reverseString.cpp
q59_02_maxQue.cpp		q59_02_maxQue.cpp
q59_maxOfWin.cpp		q59_maxOfWin.cpp
q5_replaceSpace.cpp		q5_replaceSpace.cpp
q6.cpp		q6.cpp
q60_sumOfDice.cpp		q60_sumOfDice.cpp
q61_SeqOfPuke.cpp		q61_SeqOfPuke.cpp
q62_lastRemain.cpp		q62_lastRemain.cpp
q63_maxProfit.cpp		q63_maxProfit.cpp
q64_sumOfNum.cpp		q64_sumOfNum.cpp
q65_sumWithout+.cpp		q65_sumWithout+.cpp
q66_multiplyArray.cpp		q66_multiplyArray.cpp
q67_strToInt.cpp		q67_strToInt.cpp
q6_printListFormBack.cpp		q6_printListFormBack.cpp
q7.cpp		q7.cpp
q7_rebuildTree.cpp		q7_rebuildTree.cpp
q8.cpp		q8.cpp
q8_nextNodeInoder.cpp		q8_nextNodeInoder.cpp
q9.cpp		q9.cpp
q9_1.cpp		q9_1.cpp
q9_impQueByStack.cpp		q9_impQueByStack.cpp
quickSort.cpp		quickSort.cpp
strToInt.cpp		strToInt.cpp
test.txt		test.txt

Navigation Menu

Repository navigation

About

Repository files navigation

offer_code

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

offer_code

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages