leetcode
hui1140621618
这个作者很懒,什么都没留下…
展开
-
leetcode 107. Binary Tree Level Order Traversal II Add to List
题目:要求从左往右,从下往上层次遍历二叉树。代码AC:原创 2017-03-17 21:18:28 · 153 阅读 · 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 no原创 2017-03-15 10:44:08 · 195 阅读 · 0 评论 -
leetcode 136. Single Number
题目:Given an array of integers, every element appears twice except for one. Find that single one.找到在数组中只出现过一次的数,要求线性时间,同时空间复杂度为O(1)。思路:将数组中的元素从小到大进行排列,然后比较相邻的元素,判断相邻的元素是否相等。实现代码:另原创 2017-03-15 15:05:43 · 325 阅读 · 0 评论 -
leetcode 238 Product of Array Except Self
题目:Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].求一个数组中除了某个元素本身的其他元素之积,,最终输出所有这样原创 2017-03-15 21:24:07 · 185 阅读 · 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-03-16 11:04:30 · 242 阅读 · 0 评论 -
leetcode 82. Remove Duplicates from Sorted List II
题目: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-03-16 16:05:38 · 430 阅读 · 0 评论 -
leetcode 100. Same Tree
题目:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.判断两原创 2017-03-16 22:12:38 · 256 阅读 · 0 评论 -
leetcode 88. Merge Sorted Array
题目:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to h原创 2017-03-16 22:39:32 · 135 阅读 · 0 评论 -
leetcode 101. Symmetric Tree
题目:要求判断一棵二叉树是否对称思路:采用递归的办法,直接比较对称位置,即将left的left和right的right比较,left的right和right的left比较。时间复杂度为O(n)。代码AC:原创 2017-03-16 23:30:44 · 154 阅读 · 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.找到一棵二叉树的最大深度思路:采用递归的方法,分别找到原创 2017-03-17 10:34:19 · 362 阅读 · 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.思路:用sum减去当前节点的值,直到遇到一个叶子节点,并且此时差值为0。在做题原创 2017-03-24 15:35:04 · 182 阅读 · 0 评论 -
leetcode 69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.如果采用暴力破解法,从 0 到 x/2之间依次遍历,但是时间太慢,故选择考虑二分法。 public int mySqrt(int x) { if(x return x;原创 2017-03-13 16:23:27 · 173 阅读 · 0 评论 -
leetcode 51. N-Queens
题目链接:点击打开链接题目:The n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to原创 2017-03-28 22:40:01 · 219 阅读 · 0 评论 -
leetcode 108. Convert Sorted Array to Binary Search Tree Add to List
题目:Given an array where elements are sorted in ascending order, convert it to a height balanced BST.给定一个递增的数组,要求创建一棵二插查找树。思路:采用二分法,递归地进行创建。令中间节点为根,从而满足左子树的值小于根节点的值,同时右子树的值大于根节点的值。代码AC:原创 2017-03-17 21:55:24 · 152 阅读 · 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 ofevery node never原创 2017-03-17 22:45:13 · 337 阅读 · 0 评论 -
leetcode 111. Minimum Depth of Binary Tree
题目:Given 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 leaf node.求二叉树的最小深度,二叉树的最小深度为根节点到最近叶子节点的距原创 2017-03-18 22:15:39 · 158 阅读 · 0 评论 -
leetcode Single Number II
题目:Given an array of integers, every element appearsthree times except for one, which appears exactly once. Find that single one.Note:Your algorithm should have a linear runtime complexity原创 2017-03-27 16:34:21 · 182 阅读 · 0 评论 -
leetcode 129. Sum Root to Leaf Numbers
链接:点击打开链接题目:Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number123.原创 2017-03-27 21:30:04 · 204 阅读 · 0 评论 -
leetcode 141. Linked List Cycle
题目:Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?判断一个单项链表是否有环。思路:使用两个指针slow,fast。两个指针都从表头开始走,slow每次走一步,fast每次走原创 2017-03-20 21:14:58 · 170 阅读 · 0 评论 -
leetcode 142. Linked List Cycle II
题目:Given a linked list, return the node where the cycle begins. If there is no cycle, return null.给定一个链表,返回链表中环的第一个节点。思路:p1为环开始的节点,p2为fast指针和slow指针相遇的节点。A 、B、 C分别为三段的距离。当相遇的时候slow指针经过的原创 2017-03-20 22:01:44 · 156 阅读 · 0 评论 -
50. Pow(x, n)
题目链接:点击打开链接题目:Implement pow(x,n).实现x的n次方思路:第一次采用了快速幂的方法,结果超时了。后来参考别人的答案,选择用递归解决。同时要特别处理n代码AC:public class Solution { public double myPow(double x, int n) { i原创 2017-03-27 22:12:11 · 192 阅读 · 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:[ "((()))", "(()())", "(())()"原创 2017-04-06 16:56:56 · 216 阅读 · 0 评论