算法/LeetCode
文章平均质量分 53
zg1g
7年算法工程师,10年Python使用经验。
展开
-
500. Keyboard Row
500. Keyboard Row原创 2017-05-09 13:06:14 · 636 阅读 · 0 评论 -
7. Reverse Integer
7. Reverse Integer原创 2017-05-18 13:06:01 · 1078 阅读 · 0 评论 -
324. Wiggle Sort II
324. Wiggle Sort II原创 2017-05-31 14:55:46 · 702 阅读 · 0 评论 -
400. Nth Digit
400. Nth Digit原创 2017-05-20 12:06:24 · 897 阅读 · 0 评论 -
69. Sqrt(x)
69. Sqrt(x)原创 2017-05-20 15:30:24 · 618 阅读 · 0 评论 -
342. Power of Four
342. Power of Four原创 2017-05-31 16:17:15 · 483 阅读 · 0 评论 -
461. Hamming Distance
461. Hamming Distance原创 2017-06-01 14:01:00 · 615 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST
530. Minimum Absolute Difference in BST原创 2017-06-06 16:21:52 · 473 阅读 · 0 评论 -
476. Number Complement
476. Number Complement原创 2017-06-02 14:09:52 · 543 阅读 · 0 评论 -
4. Median of Two Sorted Arrays-python
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3]nums2原创 2017-06-28 17:25:43 · 618 阅读 · 0 评论 -
32. Longest Valid Parentheses
栈的典型应用。能想到栈,但是能想到Push字符索引,真的不是很容易(这道题一般的想法是存储‘(’ ‘)’这些符号)。原题Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.原创 2017-06-19 18:28:53 · 762 阅读 · 0 评论 -
397. Integer Replacement
397. Integer Replacement原创 2017-06-04 21:49:47 · 524 阅读 · 0 评论 -
56. Merge Intervals
56. Merge Intervals原创 2017-06-08 12:51:25 · 607 阅读 · 0 评论 -
455. Assign Cookies
455. Assign Cookies原创 2017-06-08 18:21:19 · 545 阅读 · 0 评论 -
7. Reverse Integer-python
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Note:The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integ原创 2017-06-29 20:00:20 · 1171 阅读 · 0 评论 -
9. Palindrome Number-python
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the intege原创 2017-06-29 20:07:55 · 697 阅读 · 0 评论 -
12. Integer to Roman-python
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Codeclass Solution(object): def intToRoman(self, num): """ :type num: int原创 2017-06-29 22:25:09 · 556 阅读 · 0 评论 -
2. Add Two Numbers
2. Add Two Numbers原创 2017-06-09 15:00:18 · 716 阅读 · 0 评论 -
14. Longest Common Prefix-python
Write a function to find the longest common prefix string amongst an array of strings.思路随机选取一个字符作为最长公共前缀遍历这个前缀的每个字符若所有的字符串都含有这个字符,则最长公共前缀指针前进1Codeclass Solution(object): def longestCommonPrefix原创 2017-06-30 21:17:23 · 712 阅读 · 0 评论 -
34. Search for a Range
原题Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target原创 2017-06-21 09:28:19 · 398 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number-python
Leetcode上对deque不支持,所以用list和游标模拟队列,应为这个题目是队列的经典应用。原题Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon原创 2017-07-02 10:03:17 · 1297 阅读 · 0 评论 -
4. Median of Two Sorted Arrays(归并排序思想)
原题There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1: nums1 =原创 2017-06-10 14:00:41 · 3064 阅读 · 0 评论 -
347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume k is always valid, 1 ? k ? number of unique eleme原创 2017-07-12 08:36:04 · 395 阅读 · 0 评论 -
19. Remove Nth Node From End of List
19. Remove Nth Node From End of List原创 2017-06-11 15:31:50 · 745 阅读 · 0 评论 -
28. Implement strStr()
原题Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.代码实现public int StrStr(string haystack, string needle) {原创 2017-06-11 16:10:20 · 567 阅读 · 0 评论 -
38. Count and Say
原题The count-and-say sequence is the sequence of integers with the first five terms as following: 1 11 21 1211 111221 1 is read off as “one 1” or 11. 11 is read off as “two 1s” o原创 2017-06-11 17:21:43 · 2235 阅读 · 0 评论 -
48. Rotate Image
原题You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up: Could you do this in-place?代码实现算法思想: public class Solution { //This is in原创 2017-06-23 10:33:46 · 1318 阅读 · 0 评论 -
图像顺时针步进1个像素点的算法
矩阵步进1的算法public void Rotate(int[,] matrix) { int n = matrix.GetUpperBound(0) + 1; int loop = n >> 1; for (int i = 0; i < loop; i++) {原创 2017-06-22 22:35:05 · 1258 阅读 · 0 评论 -
70. Climbing Stairs
70. Climbing Stairs原创 2017-06-11 21:41:32 · 774 阅读 · 0 评论 -
165. Compare Version Numbers
Compare Version Numbers原创 2017-06-11 22:16:34 · 639 阅读 · 0 评论 -
172. Factorial Trailing Zeroes
原题Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.代码实现计算阶乘n的尾数0的个数 public int TrailingZeroes(int n) {原创 2017-06-12 13:10:33 · 567 阅读 · 0 评论 -
347.Top K Frequent Elements-Python
Given a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume k is always valid, 1 ? k ? number of unique eleme原创 2017-07-12 16:29:19 · 537 阅读 · 0 评论 -
19. Remove Nth Node From End of List-python
原题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 l原创 2017-07-03 21:27:02 · 767 阅读 · 0 评论 -
5. Longest Palindromic Substring
背景 “回文”是指正读反读都能读通的句子,它是古今中外都有的一种修辞方式和文字游戏,如“我为人人,人人为我”等。在数学中也有这样一类数字有这样的特征,成为回文数(palindrome number)。设n是一任意自然数。若将n的各位数字反向排列所得自然数n1与n相等,则称n为一回文数。例如,若n=1234321,则称n为一回文数;但若n=1234567,则n不是回文数。 注意:原创 2017-06-13 08:38:46 · 2079 阅读 · 0 评论 -
研究算法的重要性
为什么要研究算法?听听李开复怎么说。原创 2017-04-29 22:28:06 · 9611 阅读 · 10 评论 -
21. Merge Two Sorted Lists-Python
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.思路 递归最容易实现,根据l1和l2的头元素大小,决定头元素的指向,这样问题的规模减1,递归直到满足其中的3个返回条件原创 2017-07-04 21:05:07 · 1260 阅读 · 2 评论 -
13. Roman to Integer
13. Roman to IntegersoI placed before V or X indicates one less, so four is原创 2017-06-05 14:39:06 · 721 阅读 · 0 评论 -
12. Integer to Roman
Integer to Roman原创 2017-06-13 17:26:12 · 625 阅读 · 0 评论 -
15. 3Sum
这道题最难的是所求解不能包含重复的triplets。原题Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution原创 2017-06-14 08:44:41 · 477 阅读 · 0 评论 -
16. 3Sum Closest
原题Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa原创 2017-06-14 10:29:42 · 517 阅读 · 0 评论