LeetCode
文章平均质量分 71
旻宇
New Acmer
展开
-
Leetcode #212 Word Search II
Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horiz原创 2015-08-01 12:31:27 · 422 阅读 · 0 评论 -
Leetcode #79 Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2015-07-31 19:34:21 · 359 阅读 · 0 评论 -
Leetcode #236 Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two node原创 2015-07-31 15:19:05 · 362 阅读 · 0 评论 -
Leetcode #242 Valid Anagram
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.Note:You may assum原创 2015-08-01 19:57:25 · 538 阅读 · 0 评论 -
Leetcode #234 Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?用o(1)的space来创建一个反向的链表,也能AC,时间是36ms,代码如下:class Solution {public: bool isPa原创 2015-08-01 16:57:07 · 354 阅读 · 0 评论 -
Leetcode #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 digit 1 occurred in the follow原创 2015-08-01 14:23:27 · 419 阅读 · 0 评论 -
Leetcode Majority Element系列 摩尔投票法
Given an integer array of size n, find all elements that appear more than⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.挺有意思的摩尔投票法public: vector majorityElement(vec原创 2015-08-01 18:59:36 · 1956 阅读 · 0 评论 -
Leetcode #228 Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].Credits:Special thanks to @jianchao.li.fighter fo原创 2015-08-01 21:48:03 · 399 阅读 · 0 评论 -
Leetcode #240 Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in原创 2015-07-30 20:00:59 · 305 阅读 · 0 评论 -
Leetcode #74 Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2015-07-30 18:51:29 · 334 阅读 · 0 评论 -
Leetcode #239 Sliding Window Maximum
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see thek numbers in the window. Each time the sliding window原创 2015-07-31 09:49:12 · 403 阅读 · 0 评论 -
Leetcode #238 Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements ofnums except nums[i].Solve it without division and in O(原创 2015-07-31 12:41:27 · 361 阅读 · 0 评论 -
Leetcode #230 Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find thekth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.Follow up:What if the BS原创 2015-08-01 18:27:42 · 410 阅读 · 0 评论 -
Leetcode #222 Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely fille原创 2015-08-02 18:53:51 · 345 阅读 · 0 评论 -
LeetCode #215 Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and k = 2, return 5.N原创 2015-08-06 22:04:10 · 348 阅读 · 0 评论 -
Leetcode #209 Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the array [2,3,1原创 2015-08-07 10:38:01 · 337 阅读 · 0 评论 -
LeetCode #217 Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2015-08-03 17:41:43 · 482 阅读 · 0 评论 -
LeetCode #33 Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its原创 2015-08-14 16:31:12 · 397 阅读 · 0 评论 -
LeetCode # 149 Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. 本题有点戏剧性,在本地测试代码的时候,答案并不正确,经过很长时间反复排查逻辑后提交竟然AC了,估计是我GCC-C++版本浮点型计算的精度问题。class Solution {pub原创 2015-08-02 22:19:34 · 403 阅读 · 0 评论 -
LeetcCode #220 Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] andnums[j] is at most t and the difference between i and原创 2015-08-03 15:46:21 · 420 阅读 · 0 评论 -
LeeetCode #84 Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o原创 2015-08-14 19:17:44 · 471 阅读 · 0 评论 -
LeetCode Find Minimum in Rotated Sorted Array系列
#153 Find Minimum in Rotated Sorted ArraySuppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum ele原创 2015-08-10 20:16:59 · 375 阅读 · 0 评论 -
LeetCode #65 Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous.原创 2015-08-02 20:06:29 · 397 阅读 · 0 评论 -
Leetcode Basic Calculator 系列
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces. The integer division should原创 2015-08-02 13:25:46 · 481 阅读 · 0 评论 -
Leetcode #223 Rectangle Area
Find the total area covered by two rectilinear rectangles in a2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the total a原创 2015-08-02 17:16:27 · 399 阅读 · 0 评论 -
Leetcode #218 The Skyline Problem
A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as原创 2015-07-29 20:21:19 · 457 阅读 · 0 评论 -
LeetCode #164 Maximum Gap
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements原创 2015-08-10 12:44:10 · 404 阅读 · 0 评论 -
LeetCode #174 Dungeon Game
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially p原创 2015-08-10 11:40:34 · 460 阅读 · 0 评论 -
leetcode #7 Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2015-05-17 23:11:32 · 328 阅读 · 0 评论 -
leetcode #6 ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I原创 2015-05-17 21:50:14 · 367 阅读 · 0 评论 -
Leetcode #10 Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire inpu原创 2015-05-27 19:50:12 · 326 阅读 · 0 评论 -
LeetCode #187 Repeated DNA Sequences
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Wri原创 2015-05-17 00:08:04 · 368 阅读 · 0 评论 -
LeetCode Best Time to Buy and Sell Stock 系列
121 Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie, buy原创 2015-05-02 22:55:28 · 448 阅读 · 0 评论 -
leetcode #2 Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2015-03-22 17:28:00 · 411 阅读 · 0 评论 -
leetcode #1 Two Sum
URL: https://leetcode.com/problems/two-sum/题目描述:Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of th原创 2015-03-22 15:33:10 · 405 阅读 · 0 评论 -
LeetCode #189 Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as you ca原创 2015-03-30 12:50:20 · 374 阅读 · 0 评论 -
LeetCode #4 Median of Two Sorted Arrays
题目描述:There are two sorted arrays A and B 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)).很经典的题, O(log (m+n))的时间原创 2015-03-22 23:12:34 · 323 阅读 · 0 评论 -
LeetCode #3 Longest Substring Without Repeating Characters
题目描述:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length i原创 2015-03-22 20:27:20 · 345 阅读 · 0 评论 -
LeetCode #190 Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101原创 2015-03-25 02:09:10 · 394 阅读 · 0 评论 -
leetcode #8 String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case原创 2015-05-18 22:33:59 · 439 阅读 · 0 评论