leetcode刷题
走在不归路上
这个作者很懒,什么都没留下…
展开
-
Leetcode 14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.题目大意:寻找一个字符串数组的最长共同前缀并返回此前缀。分析:前缀不会超过字符class Solution {public: string longestCommonPrefix(vector& strs)原创 2016-03-29 11:10:55 · 220 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree
问题描述:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \原创 2016-08-12 17:05:06 · 219 阅读 · 0 评论 -
LeetCode 383. Ransom Note
问题描述:Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can原创 2016-08-12 15:52:54 · 1709 阅读 · 2 评论 -
LeetCode 337. House Robber III
问题描述:The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. A转载 2016-08-12 15:34:26 · 498 阅读 · 0 评论 -
LeetCode 198. House Robber
问题描述:You 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 adj原创 2016-08-12 11:24:00 · 229 阅读 · 0 评论 -
LeetCode 257. Binary Tree Paths
问题描述:Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]原创 2016-08-21 20:41:49 · 281 阅读 · 0 评论 -
LeetCode 121. Best Time to Buy and Sell Stock
问题描述:Say 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原创 2016-08-09 19:55:12 · 235 阅读 · 0 评论 -
LeetCode 152. Maximum Product Subarray
问题描述:Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has t原创 2016-08-09 19:43:40 · 479 阅读 · 0 评论 -
LeetCode 53. Maximum Subarray
问题描述:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4原创 2016-08-09 19:24:23 · 237 阅读 · 0 评论 -
LeetCode : 223. Rectangle Area
问题描述:Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume th原创 2016-08-30 16:02:19 · 352 阅读 · 0 评论 -
LeetCode : 160. Intersection of Two Linked Lists
问题描述:Write 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 ↘原创 2016-08-29 17:27:11 · 391 阅读 · 0 评论 -
LeetCode : 389. Find the Difference
问题描述:Given two strings s and t which consist of only lowercase letters.String t is generated by random shuffling string s and then add one more letter at a random position.Find the lette原创 2016-08-29 17:02:16 · 1003 阅读 · 0 评论 -
LeetCode: 112. Path Sum
问题描述:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tr原创 2016-08-15 15:44:36 · 265 阅读 · 0 评论 -
LeetCode 225. Implement Stack using Queues
问题描述:Implement 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() --原创 2016-08-18 20:05:47 · 295 阅读 · 0 评论 -
LeetCode: 107. Binary Tree Level Order Traversal II
问题描述:Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree [3,9,20,原创 2016-08-18 18:44:58 · 265 阅读 · 0 评论 -
LeetCode 102. Binary Tree Level Order Traversal
问题描述:Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3原创 2016-08-18 18:41:37 · 279 阅读 · 0 评论 -
LeetCode 88. Merge Sorted Array
问题描述:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to原创 2016-08-26 17:06:59 · 470 阅读 · 0 评论 -
371. Sum of Two Integers
问题描述:Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.Credits:Special thanks to @fujiaozhu for a原创 2016-07-21 15:30:20 · 215 阅读 · 0 评论 -
LeetCode 387. First Unique Character in a String
问题描述:Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s = "leetcode"return 0.s = "loveleetcode",return 2.原创 2016-08-25 11:05:34 · 427 阅读 · 0 评论 -
LeetCode 118. Pascal's Triangle
问题描述:Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]分析:规律很简单,二维数组res。原创 2016-08-14 18:45:26 · 257 阅读 · 0 评论 -
LeetCode 119. Pascal's Triangle II
问题描述:Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space?分析:原创 2016-08-14 19:12:14 · 244 阅读 · 0 评论 -
leetcode4: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)).题目大意就是给定两个长度分别为m、n的有序数组,求他们原创 2016-03-26 21:31:21 · 202 阅读 · 0 评论 -
LeetCode :232. Implement Queue using Stacks(剑指offer面试题)
剑指offer面试题,牛客网代码提交通过原创 2016-02-18 11:18:47 · 396 阅读 · 0 评论 -
leetcode:Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements./** * Definition for a原创 2016-03-25 15:40:57 · 233 阅读 · 0 评论 -
leetcode 11.Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2016-03-29 09:45:40 · 245 阅读 · 0 评论 -
LeetCode16. 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 exact原创 2016-03-29 16:21:44 · 204 阅读 · 0 评论 -
20. Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2016-03-30 19:24:03 · 227 阅读 · 0 评论 -
LeetCode 21. Merge Two Sorted Lists
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.题目大意是将两个有序的链表合并成一个链表。 这道题比较简单,直接上代码了。/** * Definitio原创 2016-03-30 19:50:25 · 231 阅读 · 0 评论 -
LeetCode 22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()原创 2016-03-30 20:19:57 · 229 阅读 · 0 评论 -
LeetCode 24. Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y原创 2016-03-31 17:35:39 · 237 阅读 · 0 评论 -
LeetCode 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路:将每个链表的头结点取出来,建立一个最小堆,每次取堆顶元素(即K个链表中的最小值),然后将其合并到链表中,再将堆顶元素的下一个元素加入堆中,调整堆,使其满足最小堆,然后再取堆顶元素,如此反复,原创 2016-04-01 16:09:50 · 228 阅读 · 0 评论 -
LeetCode 34. Search for a Range
1、有序数组,第一时间想到的就是二分法。vector searchRange(vector& nums, int target) { vector res; int low = -1; int high = -1; int start = 0; int end = nums.size()-1;原创 2016-05-31 11:53:19 · 199 阅读 · 0 评论 -
LeetCode 278. First Bad Version
题目说明:You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed b原创 2016-05-31 14:51:57 · 241 阅读 · 0 评论 -
LeetCode 35. Search Insert Position
Given 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 order.You may assume no duplicates in the array.原创 2016-05-31 16:20:11 · 1434 阅读 · 0 评论 -
LeetCode 58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-05-31 16:39:50 · 258 阅读 · 0 评论 -
LeetCode 38. Count and Say
问题描述:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read原创 2016-06-03 11:56:27 · 249 阅读 · 0 评论 -
LeetCode 110. Balanced Binary Tree
问题描述:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node原创 2016-08-15 14:12:44 · 239 阅读 · 0 评论 -
LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
问题描述:Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is d原创 2016-07-27 16:33:03 · 227 阅读 · 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 e原创 2016-06-23 11:35:03 · 224 阅读 · 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:原创 2016-06-22 15:37:57 · 222 阅读 · 0 评论