LeetCode
feng_zhiyu
这个作者很懒,什么都没留下…
展开
-
【leetcode 1. Two Sum】(两数之和)
题目链接Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the...原创 2018-05-20 16:56:23 · 381 阅读 · 0 评论 -
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-09-29 19:45:19 · 242 阅读 · 0 评论 -
226. Invert Binary Tree
Invert a binary tree.Example:Input: 4 / \ 2 7 / \ / \1 3 6 9Output: 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this origin...原创 2018-09-28 20:27:04 · 266 阅读 · 0 评论 -
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]Follow up: Recursive solution is trivial, ...原创 2018-09-28 20:11:03 · 277 阅读 · 0 评论 -
169. Majority Element
Given 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 non-empty and the majority element a...原创 2018-10-07 19:42:18 · 424 阅读 · 0 评论 -
137. Single Number II
Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime complexity....原创 2018-10-07 19:41:31 · 300 阅读 · 0 评论 -
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.Example 1:Input: n = 12Output: 3 Explanation: 12 = 4 + 4 + 4.Example...原创 2018-10-13 14:56:37 · 536 阅读 · 0 评论 -
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...原创 2018-10-13 14:55:42 · 287 阅读 · 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 typ...原创 2018-05-31 19:34:07 · 368 阅读 · 0 评论 -
【LeetCode 14. Longest Common Prefix】(最长公共前缀,indexOf or sort)
Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string “”.Example 1:Input: [“flower”,”flow”,”flight”] Output:...原创 2018-05-31 18:55:08 · 438 阅读 · 0 评论 -
【LeetCode 9. Palindrome Number】(回文数判断)
题目链接 Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.Example 1:Input: 121 Output: true Example 2:Input: -121 Output: false...原创 2018-05-31 18:35:42 · 346 阅读 · 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 nu...原创 2018-05-31 17:40:09 · 263 阅读 · 0 评论 -
【LeetCode 107. Binary Tree Level Order Traversal II】(已知层次遍历输出后序遍历,BFS)
题目链接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,n...原创 2018-06-06 22:02:38 · 276 阅读 · 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.Ex...原创 2018-06-06 19:22:41 · 338 阅读 · 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 re...原创 2018-05-20 18:15:31 · 263 阅读 · 0 评论 -
【leetcode 7. Reverse Integer】
Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123 Output: 321 Example 2:Input: -123 Output: -321 Example 3:Input: 120 Output: 21 Note: Assume we are deali...原创 2018-05-20 17:24:03 · 276 阅读 · 0 评论 -
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-09-29 19:45:51 · 253 阅读 · 0 评论