leetcode
kker__
知识的追随者
展开
-
[python]Intersection of Two Arrays
Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].Note: Each element in the result must be unique. The result can be in原创 2016-05-29 21:53:46 · 724 阅读 · 0 评论 -
[leetcode] Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1: Input: 16 Returns:原创 2016-07-03 20:04:28 · 286 阅读 · 0 评论 -
[Python]Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].Subscribe to see which companies asked this question# Defin原创 2016-06-15 23:20:31 · 1068 阅读 · 0 评论 -
[java][leetcode 372]Super Pow
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example1:a = 2 b = [3]Result: 8 Example2:a = 2 b = [1,0原创 2016-07-22 16:48:15 · 832 阅读 · 0 评论 -
[python][leetcode]Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times as it原创 2016-05-30 12:51:01 · 444 阅读 · 0 评论 -
[C]LeetCode:Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2016-03-09 19:25:14 · 259 阅读 · 0 评论 -
[C]LeetCode: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.题目获取一个二叉树的最大深度: 首先想到的当然是DFS算法/** * Defini原创 2016-03-09 20:17:42 · 238 阅读 · 0 评论 -
[C]LeetCode:Counting Bits
Given 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 as an array.Example: For num = 5 you sh原创 2016-03-20 16:37:53 · 412 阅读 · 0 评论 -
[C]LeetCode: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 differ by原创 2016-03-09 21:57:22 · 299 阅读 · 0 评论 -
[leetcode]Tow Sum(java)
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.Example: Given nums = [2, 7, 11,原创 2016-09-19 21:45:55 · 317 阅读 · 0 评论