LeetCode
文章平均质量分 54
柳婼
努力成为萌萌的程序媛~
展开
-
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.分析:位运算~首先,已知异或(就是这个“^”符号)可以得到:0^0 = 00^1原创 2016-07-21 19:27:37 · 541 阅读 · 1 评论 -
LeetCode 198. House Robber
198. House RobberMy Submissions QuestionEditorial SolutionTotal Accepted: 63867 Total Submissions: 187771 Difficulty: EasyYou are a professional robber planning to rob houses along a street. Eac原创 2016-07-22 02:16:23 · 412 阅读 · 0 评论 -
LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
235. Lowest Common Ancestor of a Binary Search TreeMy Submissions QuestionEditorial SolutionTotal Accepted: 63643 Total Submissions: 168231 Difficulty: EasyGiven a binary search tree (BST), find原创 2016-07-22 02:17:09 · 434 阅读 · 0 评论 -
LeetCode 13. Roman to Integer
13. Roman to IntegerMy Submissions QuestionEditorial SolutionTotal Accepted: 80246 Total Submissions: 205709 Difficulty: EasyGiven a roman numeral, convert it to an integer.Input is guarante原创 2016-07-22 13:25:59 · 427 阅读 · 0 评论 -
LeetCode 26. Remove Duplicates from Sorted Array
26. Remove Duplicates from Sorted ArrayMy Submissions QuestionEditorial SolutionTotal Accepted: 123663 Total Submissions: 371141 Difficulty: EasyGiven a sorted array, remove the duplicates in pl原创 2016-07-22 13:26:34 · 373 阅读 · 0 评论 -
LeetCode 66. Plus One
66. Plus OneMy Submissions QuestionEditorial SolutionTotal Accepted: 94851 Total Submissions: 284653 Difficulty: EasyGiven a non-negative number represented as an array of digits, plus one to th原创 2016-07-22 13:27:10 · 448 阅读 · 0 评论 -
LeetCode 24. Swap Nodes in Pairs
24. Swap Nodes in PairsMy Submissions QuestionEditorial SolutionTotal Accepted: 91202 Total Submissions: 260548 Difficulty: EasyGiven a linked list, swap every two adjacent nodes and return its原创 2016-07-22 13:27:54 · 443 阅读 · 0 评论 -
LeetCode 21. Merge Two Sorted Lists
21. Merge Two Sorted ListsMy Submissions QuestionEditorial SolutionTotal Accepted: 120589 Total Submissions: 342161 Difficulty: EasyMerge two sorted linked lists and return it as a new list. The原创 2016-07-22 13:29:32 · 321 阅读 · 1 评论 -
LeetCode 326. Power of Three
326. Power of ThreeGiven an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?//记住考虑特殊条件 n <= 0 。。否则会超时。。class原创 2016-07-22 13:31:34 · 333 阅读 · 0 评论 -
LeetCode 231. Power of Two
231. Power of TwoGiven an integer, write a function to determine if it is a power of two.update v2.0:class Solution {public: bool isPowerOfTwo(int n) { if(n <= 0) return原创 2016-07-22 13:33:54 · 353 阅读 · 1 评论 -
LeetCode 27. Remove Element
27. Remove ElementGiven an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-07-22 13:34:44 · 254 阅读 · 0 评论 -
LeetCode 202. Happy Number
202. Happy NumberWrite an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the原创 2016-07-22 13:35:34 · 388 阅读 · 0 评论 -
LeetCode 263. Ugly Number
263. Ugly NumberWrite 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原创 2016-07-22 13:36:25 · 385 阅读 · 0 评论 -
LeetCode 70. Climbing Stairs
70. Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?class Sol原创 2016-07-22 13:37:29 · 277 阅读 · 0 评论 -
LeetCode 83. Remove Duplicates from Sorted List
83. Remove Duplicates from Sorted ListGiven 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, re原创 2016-07-22 13:38:11 · 267 阅读 · 0 评论 -
LeetCode 191. Number of 1 Bits
191. Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1′ bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11′ has binar原创 2016-07-22 13:38:48 · 342 阅读 · 0 评论 -
LeetCode 217. Contains Duplicate
217. Contains DuplicateGiven 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 retur原创 2016-07-22 13:39:59 · 301 阅读 · 0 评论 -
LeetCode 169. Majority Element
169. Majority ElementGiven 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原创 2016-07-22 13:40:36 · 323 阅读 · 0 评论 -
LeetCode 171. Excel Sheet Column Number
171. Excel Sheet Column NumberRelated to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example:A -> 1B -原创 2016-07-22 13:41:14 · 317 阅读 · 0 评论 -
LeetCode 242. Valid Anagram
242. Valid AnagramGiven two strings s and t, write a function to determine if t is an anagram of s.For example,s = “anagram”, t = “nagaram”, return true.s = “rat”, t = “car”, return false.原创 2016-07-22 13:41:47 · 335 阅读 · 0 评论 -
LeetCode 100. Same Tree
100. Same TreeGiven 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 valu原创 2016-07-22 13:42:32 · 319 阅读 · 0 评论 -
LeetCode 237. Delete Node in a Linked List
237. Delete Node in a Linked ListWrite 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原创 2016-07-22 13:43:04 · 366 阅读 · 0 评论 -
LeetCode 226. Invert Binary Tree
226. Invert Binary TreeMy Submissions QuestionEditorial SolutionTotal Accepted: 82224 Total Submissions: 182953 Difficulty: EasyInvert a binary tree.4/ \2 7/ \ / \1 3 6 9to4/原创 2016-07-22 13:44:01 · 330 阅读 · 0 评论 -
LeetCode 111. Minimum Depth of Binary Tree
111. Minimum Depth of Binary TreeMy Submissions QuestionEditorial SolutionTotal Accepted: 101139 Total Submissions: 331361 Difficulty: EasyGiven a binary tree, find its minimum depth.The minimum ...原创 2016-07-22 13:44:54 · 384 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary TreeGiven 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./**原创 2016-07-22 13:45:34 · 431 阅读 · 0 评论 -
LeetCode 292. Nim Game
292. Nim GameTotal Accepted: 59733 Total Submissions: 113879 Difficulty: EasyYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you t原创 2016-07-22 13:47:42 · 528 阅读 · 1 评论 -
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原创 2016-07-22 00:24:51 · 331 阅读 · 0 评论 -
LeetCode 52. N-Queens II
Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.分析:和LeetCode 51. N-Queens一样,只需改动几行代码即可~class Solution { int cnt原创 2016-07-22 00:28:18 · 307 阅读 · 0 评论 -
LeetCode 51. N-Queens
Given an integer n, return all distinct solutions to the n-queens puzzle.Each solution contains a distinct board configuration of the n-queens’ placement, where ‘Q’ and ‘.’ both indicate a queen原创 2016-07-22 00:29:42 · 411 阅读 · 0 评论 -
LeetCode上Tag为深度优先搜索(Depth-frist Search)的题目整理
101. Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:1/ \2 2/ \ / \3原创 2016-07-22 00:59:49 · 695 阅读 · 1 评论 -
LeetCode 103. Binary Tree Zigzag Level Order Traversal
103. Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes values. (ie, from left to right, then right to left for the next level and原创 2016-07-22 01:09:27 · 299 阅读 · 0 评论 -
LeetCode199. Binary Tree Right Side View
199. Binary Tree Right Side ViewGiven a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Give原创 2016-07-22 01:10:00 · 291 阅读 · 0 评论 -
LeetCode上Tag为广度优先搜索BFS(Breadth-first Search)的题目整理
http://www.liuchuo.net/archives/1247原创 2016-07-22 01:10:49 · 436 阅读 · 0 评论 -
LeetCode 3. Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which t原创 2016-07-22 01:12:05 · 447 阅读 · 0 评论 -
LeetCode上Tag为贪心算法(Greedy)的题目整理
http://www.liuchuo.net/archives/1231原创 2016-07-22 01:13:27 · 1472 阅读 · 0 评论 -
LeetCode 55. Jump Game
55. Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that posit原创 2016-07-22 01:14:00 · 261 阅读 · 0 评论 -
LeetCode 134. Gas Station
134. Gas StationThere are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to trave原创 2016-07-22 01:14:39 · 297 阅读 · 0 评论 -
LeetCode 330. Patching Array
30. Patching ArrayGiven a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some ele原创 2016-07-22 01:15:24 · 400 阅读 · 0 评论 -
LeetCode 91. Decode Ways
91. Decode WaysA message containing letters from A-Z is being encoded to numbers using the following mapping:‘A’ -> 1‘B’ -> 2…‘Z’ -> 26Given an encoded message containing digit原创 2016-07-22 01:16:04 · 370 阅读 · 0 评论 -
LeetCode 279. Perfect Squares
279. Perfect SquaresGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.For example, given n = 12, return 3 because 12 =原创 2016-07-22 01:16:51 · 288 阅读 · 0 评论