关注
分享
猫小时候
最近在刷LeetCode，想把自己刷题的经历写下来，然后想多认识一些代码大神，也非常希望得到大家的意见。
展开
-
Maximum Product of Word Lengths
题目名称 318. Maximum Product of Word Lengths分析 这个问题首先要判断两个字符串是否包含相同的字符，如果不包含，则计算两个字符串长度的乘积；如果有相同的字符，则乘积为0。返回最大的乘积。 因为字符串中的字符都是小写字母，从a-z总共26个，可以考虑用unsigned int类型的整数表示，unsigned int整数占32位内存，可以用第0位到第25原创 2016-09-17 14:35:19 · 718 阅读 · 0 评论 -
Permutations—回溯法求解
题目详细信息请参考我之前写的方法Permutations分析 让每个元素都能成为某种排序的第一个元素。C++代码#include<iostream>#include<vector>#include<algorithm>using namespace std;void permutation(vector<int> &num, int begin, vector<vector<int> >原创 2015-11-19 15:35:15 · 762 阅读 · 0 评论 -
Combination Sum
题目名称 Combination Sum—LeetCode链接描述 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be原创 2015-11-19 15:06:52 · 340 阅读 · 0 评论 -
Spiral Matrix
题目名称 Spiral Matrix—leetCode链接描述 Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4,原创 2015-11-02 17:30:35 · 364 阅读 · 0 评论 -
Game of Life
题目名称 Merge Sorted Array—LeetCode链接描述 According to the Wikipedia’s article: “The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conwa原创 2015-11-02 22:41:54 · 472 阅读 · 0 评论 -
Sum Root to Leaf Numbers
题目名称 Sum Root to Leaf Numbers—这里写链接内容描述 Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represen原创 2015-11-01 14:08:36 · 287 阅读 · 0 评论 -
Unique Paths
题目名称 Unique Paths—LeetCode链接描述 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 r原创 2015-10-30 15:33:04 · 357 阅读 · 0 评论 -
Palindrome Number
题目名称 Palindrome Number—LeetCode链接描述 Determine whether an integer is a palindrome. Do this without extra space.分析 判断一个数是否为回文数。回文数 我才用的方法是将整数转换成字符串，利用上一篇文章中讲到的C++字符串流<sstream>。设定一前一后指针，分别指向字符串的头尾，如果不原创 2015-10-15 10:20:13 · 504 阅读 · 0 评论 -
Remove Nth Node From End of List
题目名称 Remove Nth Node From End of List —LetCode链接描述 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 r原创 2015-10-12 17:18:09 · 446 阅读 · 0 评论 -
Remove Linked List Elements
题目名称 Remove Linked List Elements—LetCode链接描述 Remove 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 –>原创 2015-10-14 11:04:19 · 431 阅读 · 0 评论 -
Isomorphic Strings
题目名称 Isomorphic Strings—LeetCode链接描述 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 charac原创 2015-10-15 21:34:41 · 583 阅读 · 0 评论 -
Container With Most Water
题目名称 Container With Most Water—LeetCode链接描述 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原创 2015-10-29 17:09:28 · 373 阅读 · 0 评论 -
Spiral Matrix II
题目名称 Spiral Matrix II—LeetCode链接描述 Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example, Given n = 3,You should return the following matrix:[ [原创 2015-10-28 22:00:34 · 344 阅读 · 0 评论 -
Search a 2D Matrix
题目名称 Search a 2D Matrix—LeetCode链接描述 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 r原创 2015-10-29 12:35:01 · 273 阅读 · 0 评论 -
Set Matrix Zeroes
题目名称 Set Matrix Zeroes—LeetCode链接描述 Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.分析 给定一个m x n 的矩阵，如果一个元素为0，则将这个元素所在的行和列的元素全部设置为0. 这里有一个设置元素先后的问题：原创 2015-10-29 13:28:21 · 523 阅读 · 0 评论 -
Minimum Path Sum
题目名称 Minimum Path Sum—LeetCode链接描述 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can o原创 2015-10-28 15:00:45 · 384 阅读 · 0 评论 -
Combinations
题目名称 Merge Sorted Array—LeetCode链接描述 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]原创 2015-11-19 10:17:40 · 370 阅读 · 0 评论 -
Best Time to Buy and Sell Stock
题目名称 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 (i原创 2015-11-04 10:03:34 · 625 阅读 · 0 评论 -
First Missing Positive
题目名称First Missing Positive描述Given an unsorted integer array, find the first missing positive integer.For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2.Your algorithm should run in O(n) tim原创 2016-08-08 08:58:20 · 597 阅读 · 0 评论 -
Unique Paths II
题目名称 63. Unique Paths II描述 Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 re原创 2016-04-12 11:45:06 · 389 阅读 · 0 评论 -
Unique Paths
题目名称 62. 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原创 2016-04-12 10:45:04 · 401 阅读 · 0 评论 -
Path Sum II
题目名称 113. Path Sum II描述 Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binary tree and sum = 22, 5原创 2016-02-29 17:29:55 · 333 阅读 · 0 评论 -
Number of Islands
题目名称 200. Number of Islands描述 Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontall原创 2016-02-29 15:18:20 · 453 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node II
题目名称 117. Populating Next Right Pointers in Each Node II描述 Follow up for problem “Populating Next Right Pointers in Each Node”.What if the given tree could be any binary tree? Would your previous sol原创 2016-02-26 15:05:20 · 360 阅读 · 0 评论 -
Binary Tree Zigzag Level Order Traversal
题目名称 103. Binary Tree Zigzag Level Order Traversal描述 Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level原创 2016-02-26 11:18:58 · 323 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Postorder Traversal
题目名称 106. Construct Binary Tree from Inorder and Postorder Traversal描述 Given inorder and postorder traversal of a tree, construct the binary tree. 分析 这题同样是见我的博客二叉树——根据二叉树遍历序列构造二叉树C++代码/** * Defi原创 2016-02-25 22:21:32 · 341 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal
题目名称 105. Construct Binary Tree from Preorder and Inorder Traversal描述 Given preorder and inorder traversal of a tree, construct the binary tree. 分析 详细分析过程见我的博客二叉树——根据二叉树遍历序列构造二叉树C++代码/** * Defin原创 2016-02-25 22:18:55 · 445 阅读 · 0 评论 -
Lowest Common Ancestor of a Binary Tree
题目名称 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 c原创 2016-02-25 17:51:28 · 310 阅读 · 0 评论 -
Validate Binary Search Tree
题目名称 Validate Binary Search Tree—LeetCode链接描述 Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nod原创 2016-02-21 21:01:49 · 308 阅读 · 0 评论 -
Implement Trie (Prefix Tree)
题目名称 208. Implement Trie (Prefix Tree)描述 Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z.分析 字典树（Trie），又称单词查找原创 2016-03-17 21:18:03 · 473 阅读 · 0 评论 -
Range Sum Query - Immutable
题目名称 303. Range Sum Query - Immutable描述 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example: Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2)原创 2016-03-15 22:34:34 · 325 阅读 · 0 评论 -
Two Sum
题目名称 Two Sum—LeetCode链接描述 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 the two numbers such that they ad原创 2016-01-13 15:39:52 · 337 阅读 · 0 评论 -
Subsets
题目名称 Subsets—LeetCode链接描述 Given a set of distinct integers, nums, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate原创 2015-11-03 10:51:59 · 416 阅读 · 0 评论 -
Rotate Image
题目名称 Rotate Image—LeetCode链接描述 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?分析 题目中要求我们在原来的二维数组上进行修改，不要使用原创 2015-10-28 17:27:31 · 330 阅读 · 0 评论 -
Find Minimum in Rotated Sorted Array
题目名称 Find Minimum in Rotated Sorted Array—LeetCode链接描述 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 elem原创 2015-10-27 15:11:36 · 309 阅读 · 0 评论 -
Maximum Subarray
题目名称 Maximum Subarray—LeetCode链接描述 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 c原创 2015-10-27 14:34:43 · 358 阅读 · 0 评论 -
Compare Version Numbers
题目名称 Compare Version Numbers—LeetCode链接描述 Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.You may assume that原创 2015-10-20 18:19:05 · 307 阅读 · 0 评论 -
Min Stack
题目名称 Submission Details—LeetCode链接描述 Design 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 ele原创 2015-10-21 11:26:33 · 286 阅读 · 0 评论 -
Insertion Sort List
题目名称 Insertion Sort List—LeetCode链接描述 Sort a linked list using insertion sort.分析 写一个单链表的插入排序算法。给大家推荐一个非常好的学习数据结构的网站Visual Algorithm。C++代码/** * Definition for singly-linked list. * struct ListNod原创 2015-11-05 21:07:41 · 342 阅读 · 0 评论 -
Summary Ranges
题目名称 Summary Ranges—LeetCode链接描述 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"].分析 这道题题目意思很明确，对一个给定的原创 2015-10-20 16:00:06 · 399 阅读 · 0 评论