Skip to content

JasonHaoPan/LintCode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 

Repository files navigation

LintCode

<1.A+B问题> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/1_a-b-problem/a-b-problem.java
<6.合并排序数组> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/6_merge-two-sorted-arrays/merge-two-sorted-arrays.java
<9.fizz-buzz问题> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/9_fizz-buzz/fizz-buzz.java
<12.栈的最小值> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/12_min-stack/min-stack.java
<13.查找字符串> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/13_strstr/strstr.java
<14.二分查找> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/14_first-position-of-target/first-position-of-target.java
<35.翻转链表> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/35_reverse-linked-list/reverse-linked-list.java
<40.用栈实现队列> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/40_implement-queue-by-two-stacks/implement-queue-by-two-stacks.java
<41.最大子数组> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/41_maximum-subarray/maximum-subarray.java
<55.比较字符串> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/55_compare-strings/compare-strings.java
<56.两数之和> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/56_two-sum/two-sum.java
<60.搜索插入位置> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/60_search-insert-position/search-insert-position.java
<64.合并排序数组II> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/64_merge-sorted-array/merge-sorted-array.java
<66.二叉树的前序遍历> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/66_binary-tree-preorder-traversal/binary-tree-preorder-traversal.java
<67.二叉树的中序遍历> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/67_binary-tree-inorder-traversal/binary-tree-inorder-traversal.java
<68.二叉树的后序遍历> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/68_binary-tree-postorder-traversal/binary-tree-postorder-traversal.java
<69.二叉树的层次遍历> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/69_binary-tree-level-order-traversal/binary-tree-level-order-traversal.java
<75.寻找峰值> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/75_find-peak-element/find-peak-element.java
<80.中位数> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/80_median/median.java
<82.落单的数> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/82_single-number/single-number.java
<85.在二叉查找树中插入节点> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/85_insert-node-in-a-binary-search-tree/insert-node-in-a-binary-search-tree.java
<88.最近公共祖先> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/88_lowest-common-ancestor/lowest-common-ancestor.java
<93.平衡二叉树> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/93_balanced-binary-tree/balanced-binary-tree.java
<95.验证二叉查找树> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/95_validate-binary-search-tree/validate-binary-search-tree.java
<97.二叉树最大深度> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/97_maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.java
<104.合并k个排序链表> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/104_merge-k-sorted-lists/merge-k-sorted-lists.java
<111.爬楼梯> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/111_climbing-stairs/climbing-stairs.java
<112.从排序链表中删除重复值> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/112_remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.java
<113.从排序链表中删除重复值II> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/113_remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.java
<128.哈希散列函数> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/128_hash-function/hash-function.java
<129.重哈希> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/129_rehashing/rehashing.java
<149.买卖股票的最佳时机> https://github.com/mr-ppp/LintCode/tree/master/codes_and_notes/149_best-time-to-buy-and-sell-stock
<155.二叉树的最小深度> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/155_minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.java
<156.合并区间> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/156_merge-intervals/merge-intervals.java
<158.两个字符串是同位词> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/158_two-strings-are-anagrams/two-strings-are-anagrams.java
<166.链表倒数第n个节点> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/166_nth-to-last-node-in-list/nth-to-last-node-in-list.java
<174.删除链表中倒数第n个节点> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/174_remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.java
<175.翻转二叉树> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/175_invert-binary-tree/invert-binary-tree.java
<365.二进制中有多少个1> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/365_count-1-in-binary/count-1-in-binary.java
<366.斐波那契数列> https://github.com/mr-ppp/LintCode/tree/master/codes_and_notes/366_fibonacci/fibonacci.java
<372.在O(1)时间复杂度删除链表节点> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/372_delete-node-in-the-middle-of-singly-linked-list/delete-node-in-the-middle-of-singly-linked-list.java
<375.克隆二叉树> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/375_clone-binary-tree/clone-binary-tree.java
<423.有效的括号序列> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/423_valid-parentheses/valid-parentheses.java
<452.删除链表的元素> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/452_remove-linked-list-elements/remove-linked-list-elements.java
<457.经典二分查找> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/457_classical-binary-search/classical-binary-search.java
<463.整数排序> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/463_sort-integers/sort-integers.java
<469.等价二叉树> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/469_identical-binary-tree/identical-binary-tree.java
<547.两数组的交> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/547_intersection-of-two-arrays/intersection-of-two-arrays.java
<548.两数组的交II> https://github.com/mr-ppp/LintCode/blob/master/codes_and_notes/548_intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.java

About

problems that I have solved in LintCode

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors