Skip to content

taohi/interview

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

105 Commits
.gitignore
.gitignore
 
 
10-numberof1.c
10-numberof1.c
 
 
11-power.c
11-power.c
 
 
11-power_rec.c
11-power_rec.c
 
 
12-print1ToNDigits.c
12-print1ToNDigits.c
 
 
13-deleteNode.c
13-deleteNode.c
 
 
14-reorderArray.c
14-reorderArray.c
 
 
15-last_Kth_node.c
15-last_Kth_node.c
 
 
16-reverse_list.c
16-reverse_list.c
 
 
17-merge_sortedList.c
17-merge_sortedList.c
 
 
18-subTree.c
18-subTree.c
 
 
19-treeMirror.c
19-treeMirror.c
 
 
20-printMatrixClockwisely.c
20-printMatrixClockwisely.c
 
 
21-minStack.cpp
21-minStack.cpp
 
 
22-stackPopOrder.c
22-stackPopOrder.c
 
 
23-levelOrder.cpp
23-levelOrder.cpp
 
 
24-isPostOrderSearchTree.c
24-isPostOrderSearchTree.c
 
 
25-pathInTree.cpp
25-pathInTree.cpp
 
 
26-copyComlexlist.c
26-copyComlexlist.c
 
 
27-convertBST.c
27-convertBST.c
 
 
28-strPermutation.c
28-strPermutation.c
 
 
29-more_than_half.c
29-more_than_half.c
 
 
3-find.c
3-find.c
 
 
30-k_least_number.c
30-k_least_number.c
 
 
31-greatest_sum_of_subarrays.c
31-greatest_sum_of_subarrays.c
 
 
32-numof1_recursive.c
32-numof1_recursive.c
 
 
32-numof1_simple.c
32-numof1_simple.c
 
 
33-sort_as_min_number.cpp
33-sort_as_min_number.cpp
 
 
34-ugly_number.c
34-ugly_number.c
 
 
35-first_no_repeat.c
35-first_no_repeat.c
 
 
36-inverse_pairs.cpp
36-inverse_pairs.cpp
 
 
37-first_common_node.c
37-first_common_node.c
 
 
38-number_of_k.c
38-number_of_k.c
 
 
39-is_balanced_tree.c
39-is_balanced_tree.c
 
 
39-tree_depth.c
39-tree_depth.c
 
 
4-replaceblank.c
4-replaceblank.c
 
 
40-appear_once_num.c
40-appear_once_num.c
 
 
41-sequence_withsum.c
41-sequence_withsum.c
 
 
41-two_num_withsum.c
41-two_num_withsum.c
 
 
42-reverse_words.c
42-reverse_words.c
 
 
42-rotate_left.c
42-rotate_left.c
 
 
43-dices_probability.c
43-dices_probability.c
 
 
44-cards_continue.c
44-cards_continue.c
 
 
45-last_num_in_circle.cpp
45-last_num_in_circle.cpp
 
 
46-accumulate.c
46-accumulate.c
 
 
47-add_two_num.c
47-add_two_num.c
 
 
49-string_to_int.c
49-string_to_int.c
 
 
5-printListReversingly.c
5-printListReversingly.c
 
 
50-lowest_common_parent.c
50-lowest_common_parent.c
 
 
6-buildBinarytree.c
6-buildBinarytree.c
 
 
7-stackQueue.c
7-stackQueue.c
 
 
8-minInRotate.c
8-minInRotate.c
 
 
9-fibonacci.c
9-fibonacci.c
 
 
9-frogjump2.c
9-frogjump2.c
 
 
9-frogjumpN.c
9-frogjumpN.c
 
 
PermutationSequence.cpp
PermutationSequence.cpp
 
 
README.md
README.md
 
 
atoi.cpp
atoi.cpp
 
 
count_and_say.cpp
count_and_say.cpp
 
 
decodeWays.cpp
decodeWays.cpp
 
 
editDistance.cpp
editDistance.cpp
 
 
generate_parenthesis.cpp
generate_parenthesis.cpp
 
 
jobdu1530-longest_substr.c
jobdu1530-longest_substr.c
 
 
jobdu1531-cash_value.c
jobdu1531-cash_value.c
 
 
linkedListCycle.cpp
linkedListCycle.cpp
 
 
longest_common_substr.c
longest_common_substr.c
 
 
minStack.cpp
minStack.cpp
 
 
nextPermutation.cpp
nextPermutation.cpp
 
 
validPalindrome.cpp
validPalindrome.cpp
 
 
validSudoku.cpp
validSudoku.cpp
 
 

Repository files navigation

interview

剑指offer、九度OJ等面试笔试题的代码实现 语言：C/C++/python

About

剑指offer/面试题笔试题等C/C++/python代码

Resources

Readme
Activity

Stars

73 stars

Watchers

1 watching

Forks

37 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages