leetcode
文章平均质量分 67
万能锋
头是真的铁
展开
-
leetcode 141. Linked List Cycle
DiscriptionGiven a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?My solution:None 检测链表中有无cycle,可以用DPS方法,对每个node做访问过标记{0,1,2},但这需要额外空间. Discuss大神采原创 2017-07-22 16:06:54 · 252 阅读 · 0 评论 -
leetcode 219. Contains Duplicate II | 滑窗, Set
DescriptionGiven an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is a原创 2017-08-11 17:54:19 · 1797 阅读 · 0 评论 -
leetcode 205. Isomorphic Strings | str中字母计数(dict)与定位
DescriptionGiven 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 an原创 2017-08-11 16:03:54 · 235 阅读 · 0 评论 -
leetcode 203. Remove Linked List Elements | 递归的更多理解
DescriptionRemove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5/** * Definition for singly-lin原创 2017-08-11 09:56:56 · 262 阅读 · 0 评论 -
leetcode 202. Happy Number | 循环检测
DescriptionWrite an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the s原创 2017-08-10 23:47:35 · 370 阅读 · 0 评论 -
leetcode 198. House Robber | 动态规划
DescriptionYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adja原创 2017-08-10 22:57:26 · 304 阅读 · 0 评论 -
leetcode 226. Invert Binary Tree | DFS 递归转迭代
DescriptionInvert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max原创 2017-08-12 10:48:47 · 357 阅读 · 0 评论 -
leetcode 225. Implement Stack using Queues
DescriptionImplement the following operations of a stack using queues.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. empty() – Ret原创 2017-08-11 19:07:06 · 284 阅读 · 0 评论 -
leetcode 234. Palindrome Linked List
Reversing a list is not considered “O(1) space” It is a common misunderstanding that the space complexity of a program is just how much the size of additional memory space being used besides input.原创 2017-08-13 11:24:02 · 339 阅读 · 0 评论 -
leetcode 204. Count Primes
DescriptionCount the number of prime numbers less than a non-negative number, n.My solution 原始方案 比较朴素的想法就是迭代的找下去, 然后把找到的质数存起来, 对于下一个数, 如果他不能被前面任何一个质数整除, 那这个数也是一个质数(我感觉是这样的). 代码如下: class Solution { pub原创 2017-08-11 14:58:26 · 260 阅读 · 0 评论 -
leetcode 172. Factorial Trailing Zeroes
DescriptionGiven an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.My solution基本思路是:阶乘中的每个数分解因式, 总共加起来有几个5, 就对应总阶乘末尾有几个0. 最初想法为n/5,原创 2017-08-01 23:27:41 · 374 阅读 · 0 评论 -
leetcode 160. Intersection of Two Linked Lists
DescrpitionWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘原创 2017-08-01 10:49:12 · 264 阅读 · 0 评论 -
leetcode 167. Two Sum II - Input array is sorted
DescrpitionGiven an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two原创 2017-08-01 11:19:02 · 321 阅读 · 0 评论 -
leetcode 121. Best Time to Buy and Sell Stock | 最大差值和最大子序列关系
leetcode 121Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the原创 2017-07-21 16:01:44 · 476 阅读 · 1 评论 -
leetcode 125. Valid Palindrome | 回文string
回文str125. Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “原创 2017-07-21 18:49:51 · 356 阅读 · 0 评论 -
leetcode 136. Single Number | XOR的巧妙运用
DescribeGiven an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using原创 2017-07-21 21:01:03 · 527 阅读 · 0 评论 -
leetcode 155. Min Stack | 空间换时间
DescriptionDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top()原创 2017-07-22 20:19:36 · 397 阅读 · 0 评论 -
leetcode 168. Excel Sheet Column Title | 进制转化
DescriptionGiven a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB My solution实际上是转化为26进制, 故采用经典的除K取余原创 2017-08-01 16:40:38 · 326 阅读 · 0 评论 -
leetcode 169. Majority Element | 摩尔投票法
DescriptionGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority elem原创 2017-08-01 19:10:09 · 477 阅读 · 0 评论 -
leetcode 242. Valid Anagram | Map
# Description Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = "anagram", t = "nagaram", return true. s = "rat", t = "car", return false原创 2017-08-28 16:02:44 · 344 阅读 · 0 评论