leetcode
文章平均质量分 60
StubbornAnt
这个作者很懒,什么都没留下…
展开
-
leetcode 19. Remove Nth Node From End of List
题目Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked list原创 2016-05-10 16:05:22 · 342 阅读 · 0 评论 -
leetcode Binary Search
二分查找刷题笔录leetcode 35 Search Insert PositionQuestionGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in ord原创 2015-11-09 16:24:57 · 498 阅读 · 0 评论 -
leetcode DFS
leetcode 排列组合Permutation Combinations原创 2015-11-11 18:00:53 · 563 阅读 · 0 评论 -
leetcode Set Matrix Zeroes
QuestionGiven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.SolutionIf you have to store some thing, but the problem requires in place solution, you may conside原创 2015-11-16 16:14:04 · 597 阅读 · 0 评论 -
leetcode fast slow pointer
IntroductionIn questions related to linked list, fast and slow pointer solution is very common. Fast pointer step two and Slow pointer step one. Always we can the regular through draw a picture and mat原创 2015-11-19 11:06:59 · 883 阅读 · 0 评论 -
leetcode 319. Bulb Switcher
QuestionThere are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turni原创 2015-12-28 09:56:44 · 462 阅读 · 0 评论 -
leetcode dynamic programming
300. Longest Increasing SubsequenceQuestionGiven an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasi原创 2015-12-29 16:13:37 · 448 阅读 · 0 评论 -
leetcode 205. Isomorphic Strings
题目Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with another cha原创 2016-05-10 15:36:35 · 677 阅读 · 0 评论