LeetCode
这个好玩吗
Offer已在路上请耐心等待,准备入职的新人
展开
-
LeetCode-226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howe原创 2016-09-26 20:03:35 · 241 阅读 · 0 评论 -
LeetCode-303. Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRan原创 2016-10-31 22:57:07 · 279 阅读 · 0 评论 -
LeetCode - 263. Ugly Number
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si原创 2016-12-23 22:19:03 · 248 阅读 · 0 评论 -
LeetCode - 461. Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:0 ≤ x,原创 2016-12-24 10:33:16 · 318 阅读 · 0 评论 -
LeetCode - 217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is原创 2016-12-31 17:11:41 · 223 阅读 · 0 评论 -
LeetCode - 204. Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.Credits:Special thanks to @mithmatt for adding this problem and creating all test cases.统计小于n的素数个数,直接枚举会超原创 2016-12-31 17:21:20 · 259 阅读 · 0 评论 -
LeetCode - 13. Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question要先了解罗马数字转换成阿拉伯数的规则。查一下就找原创 2016-12-31 17:36:23 · 219 阅读 · 0 评论 -
LeetCode - 485. Max Consecutive Ones
Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are consecutiv原创 2017-01-17 21:01:03 · 610 阅读 · 0 评论 -
LeetCode - 67. Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".模拟二进制加法,同大整数加法原理相同。class Solution {public: string addBinary(string a, str原创 2017-01-17 21:49:46 · 270 阅读 · 0 评论 -
LeetCode - 415. Add Strings
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits 0-9.原创 2017-01-17 22:03:04 · 301 阅读 · 0 评论 -
LeetCode - 102. Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 2原创 2017-01-18 19:22:09 · 233 阅读 · 0 评论 -
LeetCode - 101. Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2017-01-18 19:49:22 · 233 阅读 · 0 评论 -
LeetCode-168. Excel Sheet Column Title
Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 -> AB class S原创 2016-10-31 17:48:46 · 253 阅读 · 0 评论 -
LeetCode-414. Third Maximum Number
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2,原创 2016-10-31 17:18:13 · 329 阅读 · 0 评论 -
LeetCode-283. Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you原创 2016-09-26 20:18:40 · 267 阅读 · 0 评论 -
LeetCode-371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.Credits:Special thanks to @fujiaozhu for adding this原创 2016-09-26 20:33:02 · 224 阅读 · 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.Subscr原创 2016-09-26 20:47:30 · 229 阅读 · 0 评论 -
LeetCode-7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Subscribe to see which companies asked this question注意返回int的范围,超原创 2016-09-26 21:19:51 · 230 阅读 · 0 评论 -
LeetCode-349. 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 res原创 2016-10-27 09:12:26 · 358 阅读 · 0 评论 -
LeetCode-237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with val原创 2016-10-27 09:25:57 · 239 阅读 · 0 评论 -
LeetCode-206. Reverse Linked List
链表逆转/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNo原创 2016-10-27 13:22:59 · 350 阅读 · 0 评论 -
LeetCode-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原创 2016-10-28 11:21:08 · 320 阅读 · 0 评论 -
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.Example:Given nums =原创 2016-10-19 19:19:08 · 203 阅读 · 0 评论 -
LeetCode-412. Fizz Buzz
Write a program that outputs the string representation of numbers from 1 to n.But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”.原创 2016-10-19 19:29:01 · 302 阅读 · 0 评论 -
LeetCode-404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.Example: 3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24原创 2016-10-30 21:58:27 · 315 阅读 · 0 评论 -
LeetCode - 93 Restore IP Addresses
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order原创 2017-06-01 17:27:42 · 341 阅读 · 0 评论