LeetCode
文章平均质量分 75
大疯疯
这个作者很懒,什么都没留下…
展开
-
LeetCode 107. Binary Tree Level Order Traversal II 树的BFS、DFS
Binary Tree Level Order Traversal II题意思路代码BFSDFS107. 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原创 2017-05-25 22:28:00 · 730 阅读 · 0 评论 -
LeetCode 257. Binary Tree Paths 递归过程保存信息
257. Binary Tree Paths Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are:原创 2017-06-01 21:24:43 · 382 阅读 · 0 评论 -
LeetCode 46. Permutations 全排列,树形状态回溯
46. 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原创 2017-06-05 22:20:27 · 700 阅读 · 0 评论 -
LeetCode 17. Letter Combinations of a Phone Number 递归回溯法
17. Letter Combinations of a Phone Number Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho原创 2017-06-05 20:35:02 · 1420 阅读 · 0 评论 -
LeetCode 131. Palindrome Partitioning 树形问题,状态回溯
131. Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s原创 2017-06-05 21:03:01 · 700 阅读 · 0 评论 -
LeetCode 83. Remove Duplicates from Sorted List ***
题目题意注意思路代码题目 Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.原创 2017-05-20 22:32:52 · 234 阅读 · 0 评论 -
LeetCode 92. Reverse Linked List II ***** 虚拟头结点
题目题意注意思路代码题目 Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Not原创 2017-05-20 22:01:01 · 285 阅读 · 0 评论 -
LeetCode 64. Minimum Path Sum 动态规划
64. Minimum Path Sum 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 only move原创 2017-06-16 16:03:58 · 503 阅读 · 0 评论 -
LeetCode 120. Triangle 动态规划
120. Triangle Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [原创 2017-06-15 23:03:49 · 958 阅读 · 0 评论 -
LeetCode 226. Invert Binary Tree 递归、指针交换 思考链表的交换
226. Invert Binary Tree Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1Trivia: This problem was i原创 2017-05-31 14:53:15 · 279 阅读 · 0 评论 -
LeetCode 347. Top K Frequent Elements 优先队列的使用及注意事项
Top K Frequent Elements题意注意思路代码结果优先队列的使用347. Top K Frequent Elements Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1,2,2,3] and k = 2原创 2017-05-26 17:38:10 · 693 阅读 · 0 评论 -
LeetCode 94. Binary Tree Inorder Traversal 树的前序、中序,后序遍历的非递归实现
题目Binary Tree Inorder TraversalBinary Tree Preorder TraversalBinary Tree Postorder Traversal思路代码题目94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes原创 2017-05-24 20:05:01 · 308 阅读 · 0 评论 -
LeetCode 102. Binary Tree Level Order Traversal 树的广度优先遍历 辅助数据结构队列
Binary Tree Level Order Traversal题意思路代码结果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原创 2017-05-25 22:15:36 · 668 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree和111. Minimum Depth of Binary Tree 递归
104. Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.原创 2017-05-27 19:34:51 · 474 阅读 · 0 评论 -
LeetCode 279. Perfect Squares 转换思维图的无权BFS,寻最短路径
Perfect Squares题意注意思路代码题外memset的使用279. 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:原创 2017-05-26 17:15:34 · 818 阅读 · 0 评论 -
LeetCode 2. Add Two Numbers ***** 进位的巧妙解决
题目 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retu原创 2017-05-22 10:47:41 · 446 阅读 · 0 评论 -
LeetCode 77. Combinations 组合问题C(n,k),树形状态回溯,优化减枝
77. 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原创 2017-06-06 21:08:42 · 790 阅读 · 0 评论 -
LeetCode 15.3Sum 18.4Sum 对撞指针 ****
题目 15-3Sum题意注意思路代码结果题目 18-4Sum题意注意思路代码结果题目 15-3Sum Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which give原创 2017-05-11 22:10:48 · 502 阅读 · 0 评论 -
LeetCode 1.Two Sum map 初次使用Markdown*****
外传 经过室友推荐blog转战Markdown编辑,初次使用还觉得挺不方便需要那么多快捷键,不如鼠标点的快。今天这一篇文章才写一半就觉得很好用,就像电脑操作用鼠标点击和windows快捷键操作一样爽,在此向还没转战的朋友推荐,顺便练习自己的操作。 不方便的是代码高亮显示不好。 参考快速上手 记录插入链接格式 题目题意注意思路1代码原创 2017-05-10 14:44:09 · 1007 阅读 · 0 评论 -
LeetCode 206. Reverse Linked List *****三指针 (pre,cur,next)
题目题意注意思路题目 Reverse a singly linked list.题意 反转一个单链表 e.g: 1->2->3->4->5->NULL NULL<-1<-2<-3<-4<-5注意 链表的题目一般不允许修改链表内的内容,只能修改指向思路 需要三个指针,分别保存之前,当前,之后的信息。 1.更改cur的next指向 2.之后pre原创 2017-05-20 21:40:23 · 1207 阅读 · 0 评论 -
LeetCode 451. Sort Characters By Frequency ***** map按值排序转vector,优先队列,频率当下标
一、题目Given a string, sort it in decreasing order based on the frequency of characters.Example 1:Input:"tree"Output:"eert"Explanation:'e' appears twice while 'r' and 't' both appear once.原创 2017-05-08 21:49:13 · 539 阅读 · 0 评论 -
LeetCode 523. Continuous Subarray sum和 525. Contiguous Array和560. Subarray Sum Equals K
523. Continuous Subarray Sum Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multi原创 2017-09-03 21:58:06 · 600 阅读 · 0 评论 -
LeetCode 70. Climbing Stairs 自顶向下记忆化搜索,自底向上重叠子问题动态规划
70. 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? Not原创 2017-06-15 19:31:30 · 616 阅读 · 0 评论 -
LeetCode 51. N-Queens 回溯
51. N-Queens The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-q原创 2017-06-14 21:04:05 · 325 阅读 · 0 评论 -
LeetCood 200. Number of Islands floodfill算法,回溯算法
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 horizontally or ve原创 2017-06-13 22:31:15 · 485 阅读 · 0 评论 -
LeetCode 79. Word Search 二维平面使用回溯法
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 horizon原创 2017-06-13 20:44:37 · 1130 阅读 · 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.原创 2017-04-19 15:36:34 · 619 阅读 · 0 评论 -
LeetCode 213. House Robber II 注意考察环尾和环头交叉处
213. House Robber II After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this plac原创 2017-06-20 21:38:21 · 338 阅读 · 0 评论 -
LeetCode 198. House Robber 递归->记忆->动态规划 ->新思路
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原创 2017-06-20 21:21:55 · 696 阅读 · 0 评论 -
LeetCode 343. Integer Break 动态规划,状态转移方程
343. Integer Break Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For exa原创 2017-06-19 15:51:36 · 542 阅读 · 0 评论 -
LeetCode 235. Lowest Common Ancestor of a Binary Search Tree 二叉搜索树
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 W原创 2017-06-02 22:11:21 · 335 阅读 · 0 评论 -
LeetCode 437. Path Sum III 递归中使用递归,分两类情况
437. Path Sum III You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the原创 2017-06-02 22:00:40 · 550 阅读 · 0 评论 -
LeetCode 112. Path Sum 注意递归的终止条件
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 b原创 2017-05-31 21:21:09 · 478 阅读 · 0 评论 -
LeetCode 404. Sum of Left Leaves 递归终止条件
404. Sum of Left Leaves Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree,原创 2017-05-31 21:46:57 · 275 阅读 · 0 评论 -
LeetCode 27. Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The原创 2017-03-12 16:28:00 · 251 阅读 · 0 评论 -
LeetCode 80. Remove Duplicates from Sorted Array II
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 five e原创 2017-03-14 11:23:16 · 300 阅读 · 0 评论 -
LeetCode 75. 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 0,原创 2017-03-14 16:45:50 · 560 阅读 · 0 评论 -
LeetCode 88. Merge Sorted Array 归并的过程
Given two sorted integer arrays nums1 and nums2, merge nums2 intonums1 as one sorted array.题意:对于有序的两个数组nums1,nums2进行归并到nums1里保持其有序性1.按照归并排序进行归并的过程,需要单独开辟一块空间O(n),时间复杂度O(n)2.在进行归并的过程,需要注意越界原创 2017-03-14 19:48:37 · 481 阅读 · 0 评论 -
LeetCode 167. Two Sum II - Input array is sorted (双索引技术对撞指针)
一.题目:Given 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-05-01 18:32:32 · 437 阅读 · 0 评论 -
LeetCode 125. Valid Palindrome 对撞指针(双索引)
一、题目Given 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."race a car" is原创 2017-05-01 19:57:14 · 657 阅读 · 0 评论