leetcode
文章平均质量分 60
back-to-back
忙忙碌碌终日,终于一事无成。
展开
-
LeetCode 之 Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the原创 2016-05-09 22:40:40 · 304 阅读 · 0 评论 -
LeetCode 之 Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.第一种方法:遍历一遍矩阵,用两个数组分别标示行和列是否存在0元素,第二次遍历按照这两个标示数组把矩阵置零,代码如下:void setZeroes(vector>& matrix) { i原创 2016-04-12 10:18:57 · 295 阅读 · 0 评论 -
LeetCode 之 Permutations
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].这道全排原创 2016-03-14 21:09:59 · 220 阅读 · 0 评论 -
LeetCode 之 Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the原创 2016-03-13 19:37:43 · 290 阅读 · 0 评论 -
LeetCode 之 Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2016-01-14 22:01:12 · 257 阅读 · 0 评论 -
LeetCode 之 Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2016-03-18 23:01:26 · 297 阅读 · 0 评论 -
LeetCode 之 Combination Sum III
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.Ensure that numbers wi原创 2016-03-14 22:12:54 · 264 阅读 · 0 评论 -
LeetCode 之 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原创 2016-03-17 11:00:19 · 210 阅读 · 0 评论 -
LeetCode 之 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-17 10:02:41 · 217 阅读 · 0 评论 -
LeetCode 之 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 of nums except nums[i].Solve it without division and in O原创 2016-01-14 22:47:37 · 219 阅读 · 0 评论 -
LeetCode 之 Increasing Triplet Subsequence
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if there exists i, j, k such that arr[i] ar原创 2016-04-12 11:23:09 · 226 阅读 · 0 评论 -
LeetCode 之 Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary tree, 1原创 2016-04-10 22:23:39 · 382 阅读 · 0 评论 -
LeetCode 之 Search for a Range
Given a sorted array of integers, 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 is not found原创 2016-05-09 13:22:58 · 258 阅读 · 0 评论 -
LeetCode 之 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 retur原创 2016-05-06 15:59:03 · 279 阅读 · 0 评论 -
LeetCode 之 Remove Duplicates from Sorted Array
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi原创 2016-05-03 21:47:34 · 246 阅读 · 0 评论 -
LeetCode 之 Find Minimum 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).Find the minimum element.You may assume no duplicate exists in原创 2016-03-18 22:59:01 · 320 阅读 · 0 评论 -
LeetCode 之 Find Minimum in Rotated Sorted Array II
Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a sorted array is rotated at some pivot unk原创 2016-05-06 14:49:11 · 289 阅读 · 0 评论 -
LeetCode 之 Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =原创 2016-05-06 14:03:10 · 231 阅读 · 0 评论 -
LeetCode 之 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"].由于数组是已经排好序的,所以只需要两个指针,一个指向连续序列的开头,一个指向连续序列的结束,遇到间原创 2016-04-11 13:38:51 · 229 阅读 · 0 评论 -
LeetCode 之 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原创 2016-04-11 13:01:25 · 221 阅读 · 0 评论 -
LeetCode 之 Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]原创 2016-04-11 12:12:32 · 275 阅读 · 0 评论 -
LeetCode 之 Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.首先要搞懂strStr()是啥,strStr()是判断一个字符串是否为另一个字符串的子串。最简单的算法是遍历(m-n)*n次,代码如下:原创 2015-12-07 19:50:52 · 273 阅读 · 0 评论 -
LeetCode 之 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?方法一:反序存一个新的链,在遍历两个链,进行比较,代码如下: bool isPalindrome(ListNode* head) {原创 2015-12-05 22:06:19 · 229 阅读 · 0 评论 -
LeetCode 之 Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.BST中深度的问题,我们可以递归(DFS),也可以迭代解决(BFS)原创 2015-11-30 22:20:58 · 205 阅读 · 0 评论 -
LeetCode 之 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 ↘原创 2015-11-30 20:07:03 · 232 阅读 · 0 评论 -
LeetCode 之 Binary Tree Level Order Traversal I and 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,#,#,15,7},原创 2015-11-25 16:08:25 · 235 阅读 · 0 评论 -
LeetCode 之 Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.最开始想到的是使用阶乘的方法:int trailingZeroes(int n) { if(n==0) retu原创 2015-11-26 22:29:25 · 236 阅读 · 0 评论 -
LeetCode 之 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]]class Solution {public:原创 2015-11-26 21:43:34 · 211 阅读 · 0 评论 -
LeetCode 之 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 adjacent house原创 2015-11-26 20:19:29 · 228 阅读 · 0 评论 -
LeetCode 之 Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the f原创 2015-11-24 22:41:41 · 267 阅读 · 0 评论 -
LeetCode 之 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.这个挺简单的,关键在于条件判断和链表指针操作,代码如下:/** * Definition for singl原创 2015-11-23 22:08:57 · 236 阅读 · 0 评论 -
LeetCode 子 Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?这是一个很简单的动态规划问题:假设S(n)为n个台阶时的原创 2015-11-22 16:39:15 · 200 阅读 · 0 评论 -
LeetCode 之 Bulb Switcher
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off原创 2016-01-19 21:39:15 · 242 阅读 · 0 评论 -
LeetCode 之 Isomorphic Strings
Given 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 anot原创 2015-12-02 19:14:54 · 207 阅读 · 0 评论 -
LeetCode 之 Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321从低到高位,对每个数字乘以翻转后的权值,在求和就行了,代码如下:class Solution {public: int reverse(int x) { long ans原创 2015-12-06 21:21:11 · 240 阅读 · 0 评论 -
LeetCode 之 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"]又是较原创 2015-12-06 15:55:21 · 380 阅读 · 0 评论 -
LeetCode 之 Bulls and Cows
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t原创 2015-12-05 20:35:31 · 225 阅读 · 0 评论 -
LeetCode 之 Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".这道题并不复杂,需要注意的是要从后往前遍历a,b求和,同时要有一个进位项,对各种情况都要分析到:string addBinary(string a, str原创 2015-12-04 20:51:55 · 216 阅读 · 0 评论 -
LeetCode 之 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 off as原创 2015-12-04 10:41:45 · 214 阅读 · 0 评论 -
LeetCode 之 Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2016-01-22 14:45:59 · 364 阅读 · 0 评论