LeetCode刷题笔记
记录leetcode刷题过程,探讨算法优解
GoRunningSnail
这个作者很懒,什么都没留下…
展开
-
leetcode 94 Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.Example:Input: [1,null,2,3] 1 \ 2 / 3Output: [1,3,2]给定一个二叉树,计算其中序遍历结果。二叉树的遍历一般分为两种,递归遍历和非递归遍历,递归遍历代...原创 2019-02-16 12:43:14 · 304 阅读 · 0 评论 -
leetcode 5 Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example 1:Input: "babad"Output: "bab"Note: "aba" is also a valid answer.Exam...原创 2019-02-09 13:58:01 · 179 阅读 · 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). Find two...原创 2019-02-09 10:22:58 · 219 阅读 · 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 return i...原创 2019-02-09 09:55:32 · 341 阅读 · 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 adjacent house...原创 2019-03-06 22:12:59 · 278 阅读 · 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.Notes:If the two linked lists have no intersection at all, returnnull. The linked lists must retain t...原创 2019-03-03 22:10:04 · 402 阅读 · 0 评论 -
leetcode 203 Remove Linked List Elements
Remove all elements from a linked list of integers that have valueval.Example:Input: 1->2->6->3->4->5->6, val = 6Output: 1->2->3->4->5给定一个链表,删除链表中值为指定值的节点。代码没有什...原创 2019-03-02 21:07:39 · 201 阅读 · 0 评论 -
leetcode 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 trying to reach the bo...原创 2019-02-24 22:26:04 · 193 阅读 · 0 评论 -
leetcode 206 Reverse Linked List
Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed either iteratively or recursi...原创 2019-02-22 23:08:25 · 170 阅读 · 0 评论 -
leetcode 230 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.Example 1:Input: root = [3,...原创 2019-02-17 10:36:30 · 371 阅读 · 0 评论 -
leetcode 461 Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:0 ≤ x, y < 23...原创 2019-02-07 10:26:34 · 230 阅读 · 0 评论 -
leetcode 260 Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.Example:Input: [1,2,1,...原创 2019-02-06 21:44:08 · 173 阅读 · 0 评论 -
leetcode 33 Search in Rotated Sorted Array
Suppose an array sorted in ascending order 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 ...原创 2019-01-27 23:16:13 · 171 阅读 · 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:[ "((()))", "(()())", "(())()", "()(())"...原创 2019-01-19 20:54:28 · 93 阅读 · 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.Example:Input: 1->2->4, 1->3->4Output: 1-...原创 2019-01-19 21:59:01 · 119 阅读 · 0 评论 -
leetcode 20 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of b...原创 2019-01-16 08:50:40 · 124 阅读 · 0 评论 -
leetcode 19 Remove Nth Node From End of List
Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, t...原创 2019-01-15 13:36:34 · 161 阅读 · 0 评论 -
leetcode 15 3Sum
Given an array nums of n integers, are there elements a, b, c in nums such that a + b+ c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must not conta...原创 2019-01-15 09:18:48 · 104 阅读 · 0 评论 -
leetcode 3 Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Example 1:Input: "abcabcbb"Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2:...原创 2019-01-11 09:18:57 · 108 阅读 · 0 评论 -
leetcode 139 Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-emptywords, determine if s can be segmented into a space-separated sequence of one or more dictionary words.Note:The s...原创 2019-01-08 22:30:26 · 141 阅读 · 0 评论 -
leetcode 136 Single Number
Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without us...原创 2019-01-05 15:53:48 · 107 阅读 · 0 评论 -
leetcode 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.Example:Input: "aab"Output:[ ["aa","b"], ["a","a"...原创 2019-01-05 08:45:05 · 153 阅读 · 1 评论 -
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 (i.e., buy one and sell one share of the stock),...原创 2019-01-02 23:08:33 · 121 阅读 · 0 评论 -
leetcode 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[ [2], [3,4], [6,5...原创 2019-01-02 22:10:42 · 100 阅读 · 0 评论 -
leetcode 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.Note: A leaf is a node with no children.Example:Given the below binary tree and sum = 22,...原创 2018-12-27 21:40:39 · 129 阅读 · 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.Note: A leaf is a node with no children.Example:...原创 2018-12-26 23:01:25 · 151 阅读 · 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 never diff...原创 2018-12-26 22:25:37 · 164 阅读 · 0 评论 -
leetcode 109 Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the ...原创 2018-12-25 09:00:46 · 136 阅读 · 0 评论 -
leetcode 108 Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the...原创 2018-12-23 15:36:37 · 99 阅读 · 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,null,null,15,7...原创 2018-12-23 14:21:42 · 106 阅读 · 0 评论 -
leetcode 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 and alternate between).For example:Given binary tre...原创 2018-12-20 09:45:33 · 106 阅读 · 0 评论 -
leetcode 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.Note: A leaf is a node with no childre...原创 2018-12-22 20:49:59 · 107 阅读 · 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 / \ 9 20 ...原创 2018-12-18 17:57:38 · 129 阅读 · 0 评论 -
leetcode 100 Same Tree
Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example ...原创 2018-12-16 22:24:02 · 110 阅读 · 0 评论 -
leetcode 90 Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: [1,2,2]...原创 2018-12-11 09:08:47 · 182 阅读 · 0 评论 -
leetcode 83 Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.Example 1:Input: 1->1->2Output: 1->2Example 2:Input: 1->1->2->3->3Output: 1-...原创 2018-12-09 20:45:54 · 134 阅读 · 0 评论 -
leetcode 82 Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinctnumbers from the original list.Example 1:Input: 1->2->3->3->4->4->5Output: 1->...原创 2018-12-26 08:39:08 · 119 阅读 · 0 评论 -
leetcode 78 Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [3], [1...原创 2018-12-07 14:32:10 · 147 阅读 · 0 评论 -
leetcode 77 Combinations
Given two integers n and k, return all possible combinations of knumbers out of 1 ... n.Example:Input: n = 4, k = 2Output:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]这是一道常规的dfs题...原创 2018-12-07 08:31:35 · 168 阅读 · 0 评论 -
leetcode 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 either down or right at a...原创 2018-11-26 08:54:58 · 109 阅读 · 0 评论