leetcode题库-LeetCode_LCCI:LeetCode中《程序员面试金典》编程题

【文件属性】：
文件名称：leetcode题库-LeetCode_LCCI:LeetCode中《程序员面试金典》编程题
文件大小：43KB
文件格式：ZIP
更新时间：2021-06-29 19:07:13
系统开源 leetcode题库 LeetCode_LCCI LeetCode中《程序员面试金典》编程题 仓库说明 1.时间轴 时间 记录内容 备注 2020年2月17日 开始着手刷题 起步 2.内容描述   本仓库链接：   本仓库为LeetCode刷题记录，网址为： ， 每个题的代码放在src中，在main.cpp设置prob_num的值，prob_num为题目编号，然后运行测试函数即可，例如需要运行题1时，在main.cpp中设置prob_num=1即可: #include #include "src/P0000_Solutions.h" using namespace std; int main() { int prob_num = 2; P0000_Solutions obj; obj.test(prob_num); cout << "Probelem " << prob_num << " run finish!" << endl; return 0; }   然后点击运行即可，题1结果如下： 0 1 Probelem 1 run finish! Process f

【文件预览】：
LeetCode_LCCI-master
----src()
--------P0003_01_TripleInOne.cpp(1KB)
--------P0005_04_ClosedNumber.h(363B)
--------P0001_01_IsUnique.h(321B)
--------P0001_09_FlippedString.h(336B)
--------P0002_05_SumLists.cpp(2KB)
--------P0000_Solutions.cpp(3KB)
--------P0004_04_CheckBalance.cpp(907B)
--------P0001_07_RotateMatrix.cpp(975B)
--------P0005_04_ClosedNumber.cpp(2KB)
--------P0002_02_KthNodeFromEndOfList.cpp(1KB)
--------P0003_02_MinStack.h(431B)
--------P0005_02_BianryNumberToString.h(348B)
--------P0005_07_Exchange.h(299B)
--------P0001_08_ZeroMatrix.h(390B)
--------P0002_03_DeleteMiddleNode.cpp(1KB)
--------P0000_CommonHead.h(476B)
--------P0003_03_StackOfPlates.h(504B)
--------P0002_04_PartitionList.h(366B)
--------P0001_03_String_to_URL_LCCI.h(357B)
--------P0004_05_LegalBinarySearchTree.cpp(4KB)
--------P0003_02_MinStack.cpp(956B)
--------P0002_06_PalindromeLinkedList.h(386B)
--------P0000_Solutions.h(1KB)
--------P0001_03_String_to_URL_LCCI.cpp(1KB)
--------P0002_01_RemoveDuplicateNode.h(395B)
--------P0002_07_IntersectionOfTwoLinkedLists.h(487B)
--------P0004_05_LegalBinarySearchTree.h(485B)
--------P0001_05_OneAway.h(316B)
--------P0001_08_ZeroMatrix.cpp(1KB)
--------P0001_02_CheckPermutation.cpp(879B)
--------P0004_04_CheckBalance.h(391B)
--------P0005_06_ConvertInteger.h(329B)
--------P0005_02_BianryNumberToString.cpp(1010B)
--------P0002_08_LinkedListCycle.h(378B)
--------P0005_03_ReverseBits.cpp(2KB)
--------P0001_04_PalindromePermutation.cpp(1KB)
--------P0001_02_CheckPermutation.h(371B)
--------P0002_01_RemoveDuplicateNode.cpp(2KB)
--------P0001_01_IsUnique.cpp(714B)
--------P0002_04_PartitionList.cpp(2KB)
--------P0005_01_InsertIntoBits.cpp(1KB)
--------P0005_06_ConvertInteger.cpp(932B)
--------P0005_01_InsertIntoBits.h(340B)
--------P0001_09_FlippedString.cpp(749B)
--------P0002_07_IntersectionOfTwoLinkedLists.cpp(2KB)
--------P0003_01_TripleInOne.h(504B)
--------P0002_02_KthNodeFromEndOfList.h(389B)
--------P0002_06_PalindromeLinkedList.cpp(2KB)
--------P0003_03_StackOfPlates.cpp(4KB)
--------P0002_05_SumLists.h(356B)
--------P0001_06_CompressString.cpp(1KB)
--------P0002_08_LinkedListCycle.cpp(2KB)
--------P0005_03_ReverseBits.h(346B)
--------P0001_07_RotateMatrix.h(348B)
--------P0001_05_OneAway.cpp(2KB)
--------P0002_03_DeleteMiddleNode.h(367B)
--------P0005_07_Exchange.cpp(995B)
--------P0001_06_CompressString.h(330B)
--------P0001_04_PalindromePermutation.h(384B)
----README.md(10KB)
----main.cpp(172B)
----CMakeLists.txt(2KB)