2020年1月29日
[LeetCode] 13. Roman to Integer
摘要： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is 阅读全文
posted @ 2020-01-29 03:08 CNoodle 阅读(504) 评论(0) 推荐(0)
[LeetCode] 12. Integer to Roman
摘要： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is 阅读全文
posted @ 2020-01-29 02:05 CNoodle 阅读(479) 评论(0) 推荐(0)
[LeetCode] 23. Merge k Sorted Lists
摘要： You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list 阅读全文
posted @ 2020-01-29 00:55 CNoodle 阅读(515) 评论(0) 推荐(0)
2020年1月28日
[LeetCode] 169. Majority Element
摘要： Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume t 阅读全文
posted @ 2020-01-28 01:54 CNoodle 阅读(155) 评论(0) 推荐(0)
2020年1月24日
[LeetCode] 49. Group Anagrams
摘要： Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearrang 阅读全文
posted @ 2020-01-24 02:35 CNoodle 阅读(501) 评论(0) 推荐(0)
2020年1月23日
[LeetCode] 451. Sort Characters By Frequency
摘要： Given a string s, sort it in decreasing order based on the frequency of characters, and return the sorted string. Example 1: Input: s = "tree" Output: 阅读全文
posted @ 2020-01-23 13:07 CNoodle 阅读(242) 评论(0) 推荐(0)
2020年1月22日
[LeetCode] 509. Fibonacci Number
摘要： The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding one 阅读全文
posted @ 2020-01-22 05:51 CNoodle 阅读(130) 评论(0) 推荐(0)
2020年1月21日
[LeetCode] 617. Merge Two Binary Trees
摘要： You are given two binary trees root1 and root2. Imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped w 阅读全文
posted @ 2020-01-21 02:45 CNoodle 阅读(174) 评论(0) 推荐(0)
[LeetCode] 541. Reverse String II
摘要： Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there ar 阅读全文
posted @ 2020-01-21 01:38 CNoodle 阅读(139) 评论(0) 推荐(0)
2020年1月18日
[LeetCode] 138. Copy List with Random Pointer
摘要： A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. Cons 阅读全文
posted @ 2020-01-18 08:09 CNoodle 阅读(522) 评论(0) 推荐(0)
2020年1月16日
[LeetCode] 9. Palindrome Number
摘要： Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from l 阅读全文
posted @ 2020-01-16 13:51 CNoodle 阅读(441) 评论(0) 推荐(0)
2020年1月15日
[LeetCode] 125. Valid Palindrome
摘要： A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the 阅读全文
posted @ 2020-01-15 03:37 CNoodle 阅读(452) 评论(0) 推荐(0)
[LeetCode] 589. N-ary Tree Preorder Traversal
摘要： Given the root of an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order 阅读全文
posted @ 2020-01-15 01:16 CNoodle 阅读(163) 评论(0) 推荐(0)
2020年1月14日
[LeetCode] 559. Maximum Depth of N-ary Tree
摘要： Given a n-ary 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 le 阅读全文
posted @ 2020-01-14 14:40 CNoodle 阅读(150) 评论(0) 推荐(0)
[LeetCode] 506. Relative Ranks
摘要： You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be u 阅读全文
posted @ 2020-01-14 02:39 CNoodle 阅读(249) 评论(0) 推荐(0)
[LeetCode] 513. Find Bottom Left Tree Value
摘要： Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1: Input: root = [2,1,3] Output: 1 Example 2: Input: r 阅读全文
posted @ 2020-01-14 01:44 CNoodle 阅读(170) 评论(0) 推荐(0)
2020年1月13日
[LeetCode] 298. Binary Tree Longest Consecutive Sequence
摘要： Given the root of a binary tree, return the length of the longest consecutive sequence path. The path refers to any sequence of nodes from some starti 阅读全文
posted @ 2020-01-13 13:28 CNoodle 阅读(227) 评论(0) 推荐(0)
2020年1月12日
[LeetCode] 113. Path Sum II
摘要： Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. 阅读全文
posted @ 2020-01-12 14:27 CNoodle 阅读(469) 评论(0) 推荐(0)
[LeetCode] 112. Path Sum
摘要： Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the 阅读全文
posted @ 2020-01-12 13:26 CNoodle 阅读(486) 评论(0) 推荐(0)
[LeetCode] 257. Binary Tree Paths
摘要： Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: Input: 1 / \ 2 3 \ 5 Output: ["1->2->5", "1->3"] 阅读全文
posted @ 2020-01-12 11:56 CNoodle 阅读(184) 评论(0) 推荐(0)