leetcode
文章平均质量分 70
gigi就是我
这个作者很懒,什么都没留下…
展开
-
leetcode解题笔记:backtracking类型解题思路
基本概念: backtracking(回溯算法)也叫试探法,它是一种系统地搜索问题的解的方法。回溯算法的基本思想是:从一条路往前走,能进则进,不能进则退回来,换一条路再试。回溯算法说白了就是穷举法。不过回溯算法使用剪枝函数,剪去一些不可能到达最终状态(即答案状态)的节点,从而减少状态空间树节点的生成。 回溯法是一个既带有系统性又带有跳跃性的的搜索算法。它在包含问题的所有解的解空间树中,按照深原创 2016-07-16 15:32:13 · 16715 阅读 · 4 评论 -
leetcode解题笔记:Regular Expression Matching
10.Regular Expression Matching ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The f原创 2016-11-27 20:36:15 · 866 阅读 · 0 评论 -
lintcode解题笔记:Reverse Pairs
532.Reverse Pairs For an array A, if i < j, and A [i] > A [j], called (A [i], A [j]) is a reverse pair. return total of reverse pairs in A. Example: Given A = [2, 4, 1, 3, 5] , (2, 1), (4,原创 2016-11-20 22:35:57 · 1897 阅读 · 0 评论 -
leetcode解题笔记:Ugly Number I & II
263.Ugly Number I Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while原创 2016-11-20 12:43:18 · 410 阅读 · 0 评论 -
leetcode解题笔记:Largest Number
179.Largest Number Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330. No原创 2016-11-19 15:38:19 · 479 阅读 · 0 评论 -
leetcode解题笔记:Number of Digit One
233.Number of Digit One Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. For example: Given n = 13, Return 6, because dig原创 2016-11-19 14:23:35 · 666 阅读 · 0 评论 -
leetcode解题笔记:Majority Element I & II
剑指offer第29题,leetcode 169,229 题目:找到数组中出现次数超过一半的数字 Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.解法一由于要寻找的数字在数组中出现次数原创 2016-11-17 22:18:36 · 519 阅读 · 0 评论 -
leetcode解题笔记:146. LRU Cache
思路:通过hashMap维护一个大小为capacity的cache,可以快速地查找要get和set的key是否已在cache中。通过一个双向链表来维持对元素操作的时间,最近操作的在链表的最后,反之最久之前操作的在链表的头部。当对一个链表中(cache)已有的元素进行操作时,将其从原来的位置移除,加到末尾。具体过程:get(key):利用HashMap查看此key是否已经存在。 若存在,则原创 2016-07-19 21:59:53 · 1462 阅读 · 0 评论 -
leetcode解题笔记:127. Word Ladder
题目要求: Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at原创 2016-07-16 15:02:43 · 1108 阅读 · 0 评论 -
leetcode解题笔记:84. Largest Rectangle in Histogram
题目地址:84. Largest Rectangle in Histogram此题是求直方图中最大的矩形面积,思路就是:对于每一个高度为h直方图。找它左边第一个比它矮的位置i,右边第一个比他矮的位置j,那么以h为高度的最大矩形面积即为h*(j-i-1).如题中高度为5的矩形,左边第一个比它矮的是高度为1的直方,位置是1,右边第一个比它矮的是高度为2的直方,位置为4,则高度为5的矩形最大面积为5*(4原创 2016-07-18 22:41:56 · 1044 阅读 · 0 评论 -
leetcode解题笔记:Two sum系列解题思路
Two Sum3Sum3Sum ClosestTwo SumGiven an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution,原创 2017-03-27 15:06:52 · 9156 阅读 · 0 评论