iframe-proxy | Sunbelt Computer Software

Repository files navigation

1、可以结合oj做题目
http://ac.jobdu.com/hhtproblems.php
2、源码可以和书本一一对应了。

About

《剑指Offer:名企面试官精讲典型编程题》源码修改版 https://leetcode.com/

www.nowcoder.com/ta/coding-interviews?page=1

Readme

Activity

0 stars

0 watching

0 forks

Report repository

Releases

No releases published

Packages

Contributors

Languages

C++ 99.2%
C 0.8%

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
Utilities		Utilities
InterviewQuestions.vcxproj		InterviewQuestions.vcxproj
InterviewQuestions.vcxproj.filters		InterviewQuestions.vcxproj.filters
InterviewQuestions.vcxproj.user		InterviewQuestions.vcxproj.user
readme.txt		readme.txt
stdafx.h		stdafx.h
面试题10之二进制中1的个数_NumberOf1InBinary.cpp		面试题10之二进制中1的个数_NumberOf1InBinary.cpp
面试题11之数值的整数次方_Power.cpp		面试题11之数值的整数次方_Power.cpp
面试题12之打印1到最大的n位数_Print1ToMaxOfNDigits.cpp		面试题12之打印1到最大的n位数_Print1ToMaxOfNDigits.cpp
面试题13之在O(1)的时间删除链表结点_DeleteNodeInList.cpp		面试题13之在O(1)的时间删除链表结点_DeleteNodeInList.cpp
面试题14之调整数组顺序使奇数位于偶数之前_ReorderArray.cpp		面试题14之调整数组顺序使奇数位于偶数之前_ReorderArray.cpp
面试题15之链表中倒数第K个结点_KthNodeFromEnd.cpp		面试题15之链表中倒数第K个结点_KthNodeFromEnd.cpp
面试题16之反转链表_ReverseList.cpp		面试题16之反转链表_ReverseList.cpp
面试题17之合并两个排序的链表_MergeSortedLists.cpp		面试题17之合并两个排序的链表_MergeSortedLists.cpp
面试题18之树的子结构_SubstructureInTree.cpp		面试题18之树的子结构_SubstructureInTree.cpp
面试题19之二叉树的镜像_MirrorOfBinaryTree.cpp		面试题19之二叉树的镜像_MirrorOfBinaryTree.cpp
面试题1之赋值运算符函数_AssignmentOperator.cpp		面试题1之赋值运算符函数_AssignmentOperator.cpp
面试题20之顺时针打印矩阵_PrintMatrix.cpp		面试题20之顺时针打印矩阵_PrintMatrix.cpp
面试题21之包含min函数的栈_MinInStack.cpp		面试题21之包含min函数的栈_MinInStack.cpp
面试题22之栈的压入弹出序列_StackPushPopOrder.cpp		面试题22之栈的压入弹出序列_StackPushPopOrder.cpp
面试题23之从上往下打印二叉树_PrintTreeFromTopToBottom.cpp		面试题23之从上往下打印二叉树_PrintTreeFromTopToBottom.cpp
面试题24之二叉搜索树的后序遍历序列_SquenceOfBST.cpp		面试题24之二叉搜索树的后序遍历序列_SquenceOfBST.cpp
面试题25之二叉树中和为某一值的路径_PathInTree.cpp		面试题25之二叉树中和为某一值的路径_PathInTree.cpp
面试题26之复杂链表的复制_CopyComplextList.cpp		面试题26之复杂链表的复制_CopyComplextList.cpp
面试题27之二叉搜索树与双向链表_ConvertBinarySearchTree.cpp		面试题27之二叉搜索树与双向链表_ConvertBinarySearchTree.cpp
面试题28之字符串的排列_StringPermutation.cpp		面试题28之字符串的排列_StringPermutation.cpp
面试题29之数组中出现次数超过一半的数字_MoreThanHalfNumber.cpp		面试题29之数组中出现次数超过一半的数字_MoreThanHalfNumber.cpp
面试题30之最小的k个数_KLeastNumbers.cpp		面试题30之最小的k个数_KLeastNumbers.cpp
面试题31之连续子数组的最大和_GreatestSumOfSubarrays.cpp		面试题31之连续子数组的最大和_GreatestSumOfSubarrays.cpp
面试题32之从1到n整数中1出现的次数_NumberOf1.cpp		面试题32之从1到n整数中1出现的次数_NumberOf1.cpp
面试题33之把数组排成最小的树_SortArrayForMinNumber.cpp		面试题33之把数组排成最小的树_SortArrayForMinNumber.cpp
面试题34之丑数_UglyNumber.cpp		面试题34之丑数_UglyNumber.cpp
面试题35之第一个只出现一次的字符_FirstNotRepeatingChar.cpp		面试题35之第一个只出现一次的字符_FirstNotRepeatingChar.cpp
面试题36之数组中的逆序对_InversePairs.cpp		面试题36之数组中的逆序对_InversePairs.cpp
面试题37之两个链表的第一个公共结点_FirstCommonNodesInLists.cpp		面试题37之两个链表的第一个公共结点_FirstCommonNodesInLists.cpp
面试题38之数字在排序数组中出现的次数_NumberOfK.cpp		面试题38之数字在排序数组中出现的次数_NumberOfK.cpp
面试题39之二叉树的深度_TreeDepth.cpp		面试题39之二叉树的深度_TreeDepth.cpp
面试题3之二维数组中的查找_FindInPartiallySortedMatrix.cpp		面试题3之二维数组中的查找_FindInPartiallySortedMatrix.cpp
面试题40之数组中只出现一次的数字_NumbersAppearOnce.cpp		面试题40之数组中只出现一次的数字_NumbersAppearOnce.cpp
面试题41之和为s的两个数字VS和为s的连续整数序列_TwoNumbersWithSum.cpp		面试题41之和为s的两个数字VS和为s的连续整数序列_TwoNumbersWithSum.cpp
面试题42之_翻转单词顺序VS左旋转字符串_ReverseWordsInSentence.cpp		面试题42之_翻转单词顺序VS左旋转字符串_ReverseWordsInSentence.cpp
面试题43之n个骰子的点数_DicesProbability.cpp		面试题43之n个骰子的点数_DicesProbability.cpp
面试题44之扑克牌的顺子_ContinousCards.cpp		面试题44之扑克牌的顺子_ContinousCards.cpp
面试题45之圆圈中最后剩下的数字_LastNumberInCircle.cpp		面试题45之圆圈中最后剩下的数字_LastNumberInCircle.cpp
面试题46之求1到n之和_Accumulate.cpp		面试题46之求1到n之和_Accumulate.cpp
面试题47之不用加减乘除做加法_AddTwoNumbers.cpp		面试题47之不用加减乘除做加法_AddTwoNumbers.cpp
面试题48之不能被继承的类_SealedClass.cpp		面试题48之不能被继承的类_SealedClass.cpp
面试题49之把字符串转换为整数_StringToInt.cpp		面试题49之把字符串转换为整数_StringToInt.cpp
面试题4之替换空格_ReplaceBlank.cpp		面试题4之替换空格_ReplaceBlank.cpp
面试题50之树中两个结点的最低公共祖先_CommonParentInTree.cpp		面试题50之树中两个结点的最低公共祖先_CommonParentInTree.cpp
面试题51之数组中重复的数字_FindDuplication.cpp		面试题51之数组中重复的数字_FindDuplication.cpp
面试题52之构建乘积数组_ArrayConstruction.cpp		面试题52之构建乘积数组_ArrayConstruction.cpp
面试题53之正则表达式匹配_RegularExpressions.cpp		面试题53之正则表达式匹配_RegularExpressions.cpp
面试题54之表示数值的字符串_NumericString.cpp		面试题54之表示数值的字符串_NumericString.cpp
面试题55之字符流中第一个不重复的字符_FirstCharacterInStream.cpp		面试题55之字符流中第一个不重复的字符_FirstCharacterInStream.cpp
面试题56之链表中环的入口结点_EntryNodeInListLoop.cpp		面试题56之链表中环的入口结点_EntryNodeInListLoop.cpp
面试题57之删除链表中重复的结点_DeleteDuplication.cpp		面试题57之删除链表中重复的结点_DeleteDuplication.cpp
面试题58之二叉树的下一个结点_NextNode.cpp		面试题58之二叉树的下一个结点_NextNode.cpp
面试题59之对称的二叉树_SymmetricalBinaryTree.cpp		面试题59之对称的二叉树_SymmetricalBinaryTree.cpp
面试题5之从头到尾打印链表_PrintListInReversedOrder.cpp		面试题5之从头到尾打印链表_PrintListInReversedOrder.cpp
面试题60之把二叉树打印成多行_PrintTreesInLines.cpp		面试题60之把二叉树打印成多行_PrintTreesInLines.cpp
面试题61之按之字形顺序打印二叉树_PrintTreesInzigzag.cpp		面试题61之按之字形顺序打印二叉树_PrintTreesInzigzag.cpp
面试题62之序列化二叉树_SerializeBinaryTrees.cpp		面试题62之序列化二叉树_SerializeBinaryTrees.cpp
面试题63之二叉搜索树的第K个结点_KthNodeInBST.cpp		面试题63之二叉搜索树的第K个结点_KthNodeInBST.cpp
面试题64之数据流中的中位数_StreamMedian.cpp		面试题64之数据流中的中位数_StreamMedian.cpp
面试题65之滑动窗口的最大值_MaxInSlidingWindow.cpp		面试题65之滑动窗口的最大值_MaxInSlidingWindow.cpp
面试题66之矩阵中的路径_StringPath.cpp		面试题66之矩阵中的路径_StringPath.cpp
面试题67之机器人的运动范围_RobotMove.cpp		面试题67之机器人的运动范围_RobotMove.cpp
面试题6之重建二叉树_ConstructBinaryTree.cpp		面试题6之重建二叉树_ConstructBinaryTree.cpp
面试题7之用两个栈实现队列_QueueWithTwoStacks.cpp		面试题7之用两个栈实现队列_QueueWithTwoStacks.cpp
面试题8之旋转数组的最小数字_MinNumberInRotatedArray.cpp		面试题8之旋转数组的最小数字_MinNumberInRotatedArray.cpp
面试题9之斐波那契数列_Fibonacci.cpp		面试题9之斐波那契数列_Fibonacci.cpp

Sunbelt Computer Software

PL/B Language Development and Support

Folders and files

Latest commit

History

Repository files navigation

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages