LeetCode
MissXy_
一定要记着,在不久的将来,你所有的付出都会有所回报的!
展开
-
LeetCode --- 120. Triangle
120. TriangleDifficulty: MediumGiven 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...原创 2019-06-22 14:56:19 · 347 阅读 · 0 评论 -
LeetCode --- 102. Binary Tree Level Order Traversal
102. Binary Tree Level Order TraversalDifficulty: MediumGiven a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example:Given binar...原创 2019-04-27 12:21:52 · 293 阅读 · 0 评论 -
LeetCode --- 98. Validate Binary Search Tree
98. Validate Binary Search TreeDifficulty: MediumGiven 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 on...原创 2019-04-18 10:41:33 · 290 阅读 · 0 评论 -
LeetCode --- 703. Kth Largest Element in a Stream
703. Kth Largest Element in a StreamDifficulty: EasyDesign a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct elem...原创 2019-04-09 22:19:39 · 290 阅读 · 0 评论 -
LeetCode --- 92. Reverse Linked List II
92. Reverse Linked List IIDifficulty: MediumReverse a linked list from position m to n. Do it in one-pass.**Note: **1 ≤ m ≤ n ≤ length of list.Example:Input: 1->2->3->4->5->NULL, m...原创 2019-04-09 19:51:55 · 258 阅读 · 0 评论 -
LeetCode --- 86. Partition List
86. Partition ListDifficulty: MediumGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original rel...原创 2019-04-09 13:17:36 · 208 阅读 · 0 评论 -
LeetCode --- 160. Intersection of Two Linked Lists
160. Intersection of Two Linked ListsDifficulty: EasyWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:begin ...原创 2019-04-03 13:33:00 · 263 阅读 · 0 评论 -
LeetCode --- 61. Rotate List
61. Rotate ListDifficulty: MediumGiven a linked list, rotate the list to the right by k places, where k is non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5-&...原创 2019-04-08 21:00:21 · 197 阅读 · 0 评论 -
LeetCode --- 82. Remove Duplicates from Sorted List II
82. Remove Duplicates from Sorted List IIDifficulty: MediumGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Example 1:...原创 2019-04-08 13:09:36 · 309 阅读 · 0 评论 -
LeetCode --- 141. Linked List Cycle
141. Linked List CycleDifficulty: EasyGiven a linked list, determine if it has a cycle in it.To represent a cycle in the given linked list, we use an integer pos which represents the position (0-in...原创 2019-04-02 13:40:40 · 255 阅读 · 0 评论 -
LeetCode --- 242. Valid Anagram
242. Valid AnagramDifficulty: EasyGiven two strings s and _t _, write a function to determine if t is an anagram of s.Example 1:Input: s = "anagram", t = "nagaram"Output: trueExample 2:Input: ...原创 2019-04-11 14:19:59 · 350 阅读 · 0 评论 -
LeetCode --- 142. Linked List Cycle II
142. Linked List Cycle IIDifficulty: MediumGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.To represent a cycle in the given linked list, we use an in...原创 2019-04-10 11:47:29 · 316 阅读 · 0 评论 -
LeetCode --- 50. Pow(x, n)
50. Pow(x, n)Difficulty: MediumImplement , which calculates x raised to the power n (xn).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100Example 3:I...原创 2019-04-23 21:16:12 · 227 阅读 · 0 评论 -
LeetCode --- 111. Minimum Depth of Binary Tree
111. Minimum Depth of Binary TreeDifficulty: EasyGiven 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 ...原创 2019-04-28 15:13:08 · 352 阅读 · 0 评论 -
LeetCode --- 235. Lowest Common Ancestor of a Binary Search Tree
235. Lowest Common Ancestor of a Binary Search TreeDifficulty: EasyGiven a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the : “The lowe...原创 2019-04-19 13:41:27 · 641 阅读 · 0 评论 -
LeetCode --- 70. Climbing Stairs
70. Climbing StairsDifficulty: EasyYou 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 to...原创 2019-06-22 14:11:39 · 307 阅读 · 0 评论 -
LeetCode --- 300. Longest Increasing Subsequence
300. Longest Increasing SubsequenceDifficulty: MediumGiven an unsorted array of integers, find the length of longest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4 Explanat...原创 2019-06-25 09:03:38 · 336 阅读 · 0 评论 -
LeetCode --- 338. Counting Bits
338. Counting BitsDifficulty: MediumGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them a...原创 2019-05-16 17:16:47 · 302 阅读 · 0 评论 -
LeetCode --- 231. Power of Two
231. Power of TwoDifficulty: EasyGiven an integer, write a function to determine if it is a power of two.Example 1:Input: 1Output: true Explanation: 20 = 1Example 2:Input: 16Output: trueExp...原创 2019-05-16 17:04:13 · 332 阅读 · 0 评论 -
LeetCode --- 191. Number of 1 Bits
191. Number of 1 BitsDifficulty: EasyWrite a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the ).Example 1:Input: 00000000000000000000000000001011...原创 2019-05-15 16:50:00 · 381 阅读 · 0 评论 -
LeetCode --- 69. Sqrt(x)
69. Sqrt(x)Difficulty: EasyImplement int sqrt(int x).Compute and return the square root of x, where x is guaranteed to be a non-negative integer.Since the return type is an integer, the decimal di...原创 2019-05-07 11:06:06 · 357 阅读 · 0 评论 -
LeetCode --- 121. Best Time to Buy and Sell Stock
121. Best Time to Buy and Sell StockDifficulty: EasySay 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 transac...原创 2019-04-25 11:23:27 · 299 阅读 · 0 评论 -
LeetCode --- 122. Best Time to Buy and Sell Stock II
122. Best Time to Buy and Sell Stock IIDifficulty: EasySay 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...原创 2019-04-25 10:57:16 · 247 阅读 · 0 评论 -
LeetCode --- 169. Majority Element
169. Majority ElementDifficulty: EasyGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is n...原创 2019-04-24 18:07:55 · 195 阅读 · 0 评论 -
LeetCode --- 22. Generate Parentheses
22. Generate ParenthesesDifficulty: MediumGiven 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-04-29 12:01:18 · 242 阅读 · 0 评论 -
LeetCode --- 236. Lowest Common Ancestor of a Binary Tree
236. Lowest Common Ancestor of a Binary TreeDifficulty: MediumGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the : “The lowest common ancesto...原创 2019-04-19 14:14:49 · 292 阅读 · 0 评论 -
LeetCode --- 237. Delete Node in a Linked List
237. Delete Node in a Linked ListDifficulty: EasyWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Given linked list – head = [4,5,1,9], wh...原创 2019-04-05 13:23:31 · 419 阅读 · 0 评论 -
LeetCode --- 232. Implement Queue using Stacks
232. Implement Queue using StacksDifficulty: EasyImplement the following operations of a queue using stacks.push(x) – Push element x to the back of queue.pop() – Removes the element from in front...原创 2019-03-27 13:17:19 · 274 阅读 · 0 评论 -
LeetCode --- 234. Palindrome Linked List
234. Palindrome Linked ListDifficulty: EasyGiven a singly linked list, determine if it is a palindrome.Example 1:Input: 1->2Output: false```**Example 2:**Input: 1->2->2->1Output...原创 2019-04-04 20:13:29 · 221 阅读 · 0 评论 -
LeetCode --- 28. 实现strStr()(Implement strStr())
28. 实现strStr()(Implement strStr())题目难度: 简单实现 函数。给定一个 haystack 字符串和一个 needle 字符串,在 haystack 字符串中找出 needle 字符串出现的第一个位置 (从0开始)。如果不存在,则返回 -1。示例 1:输入: haystack = "hello", needle = "ll"输出: 2...原创 2018-08-21 17:32:55 · 230 阅读 · 0 评论 -
LeetCode --- 27. 移除元素(Remove Element)
27. 移除元素(Remove Element)题目难度: 简单给定一个数组 nums 和一个值 val,你需要移除所有数值等于 val 的元素,返回移除后数组的新长度。不要使用额外的数组空间,你必须在修改输入数组并在使用 O(1) 额外空间的条件下完成。元素的顺序可以改变。你不需要考虑数组中超出新长度后面的元素。示例 1:给定 _nums_ = [3,2,2,3], ...原创 2018-08-21 17:18:07 · 249 阅读 · 0 评论 -
LeetCode --- 26. 删除排序数组中的重复项(Remove Duplicates from Sorted Array)
26. 删除排序数组中的重复项(Remove Duplicates from Sorted Array)题目难度: 简单给定一个排序数组,你需要在删除重复出现的元素,使得每个元素只出现一次,返回移除后数组的新长度。不要使用额外的数组空间,你必须在修改输入数组并在使用 O(1) 额外空间的条件下完成。示例 1:给定数组 _nums_ = [1,1,2], 函数应该返回新的...原创 2018-08-21 16:24:02 · 334 阅读 · 0 评论 -
LeetCode --- 21. Merge Two Sorted Lists
21. 合并两个有序链表(Merge Two Sorted Lists)题目难度: 简单将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 示例:输入:1->2->4, 1->3->4输出:1->1->2->3->4->4个人思路: 采用递归法,求链表!Solutio...原创 2018-08-21 16:02:52 · 268 阅读 · 0 评论 -
LeetCode --- 20. 有效的括号(Valid Parentheses)
20. 有效的括号(Valid Parentheses)题目难度: 简单给定一个只包括 '(',')','{','}','[',']' 的字符串,判断字符串是否有效。有效字符串需满足:左括号必须用相同类型的右括号闭合。左括号必须以正确的顺序闭合。注意空字符串可被认为是有效字符串。示例 1:输入: "()"输出: true示例 2:输入: "()[]{...原创 2018-08-21 15:36:17 · 320 阅读 · 0 评论 -
LeetCode --- 14. 最长公共前缀(Longest Common Prefix)
14. 最长公共前缀(Longest Common Prefix)题目难度: 简单编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀,返回空字符串 ""。示例 1:输入: ["flower","flow","flight"]输出: "fl"示例 2:输入: ["dog","racecar","car"]原创 2018-08-21 14:22:29 · 423 阅读 · 0 评论 -
LeetCode --- 13. 罗马数字转整数(Roman to Integer)
13. 罗马数字转整数(Roman to Integer)题目难度: 简单罗马数字包含以下七种字符:I, V, X, L,C,D 和 M。字符 数值I 1V 5X 10L 50C 100D 500M ...原创 2018-08-20 22:53:20 · 376 阅读 · 0 评论 -
LeetCode --- 9. 回文数(Palindrome Number)
9. 回文数(Palindrome Number)题目难度: 简单判断一个整数是否是回文数。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。示例 1:输入: 121输出: true示例 2:输入: -121输出: false解释: 从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。示例 3:输入: 10输出...原创 2018-08-20 20:47:07 · 387 阅读 · 0 评论 -
LeetCode --- 7. 反转整数(Reverse Integer)
7. 反转整数(Reverse Integer)题目难度: 简单给定一个 32 位有符号整数,将整数中的数字进行反转。示例 1:输入: 123输出: 321示例 2:输入: -123输出: -321示例 3:输入: 120输出: 21注意:假设我们的环境只能存储 32 位有符号整数,其数值范围是 [−231, 231 − 1]。根据这个假设,如果...原创 2018-08-20 20:12:15 · 181 阅读 · 0 评论 -
LeetCode --- 53. 最大子序和(Maximum Subarray)
53. 最大子序和(Maximum Subarray)题目难度: 简单给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。示例:输入: [-2,1,-3,4,-1,2,1,-5,4],输出: 6解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。进阶:如果你已经实现复杂度为 O(n) 的解法,尝试使用更为精妙...原创 2018-08-22 10:19:55 · 238 阅读 · 0 评论 -
LeetCode --- 2. Add Two Numbers
Add Two NumbersYou 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原创 2017-10-22 17:41:22 · 297 阅读 · 0 评论