leetcode
文章平均质量分 81
huanghanqian
少年,你还很菜。
展开
-
leetcode 500. Keyboard Row
Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.Example 1:Input: ["Hello", "Alaska", "Dad"原创 2017-05-01 17:00:02 · 281 阅读 · 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”.原创 2017-05-02 14:36:31 · 285 阅读 · 0 评论 -
leetcode 344. Reverse String
Write a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "olleh".题意很简单。然后我写了个String result; for(int i=s.length()-1;i--;i>=0){result+=s.ch原创 2017-05-02 15:34:22 · 317 阅读 · 0 评论 -
leetcode 513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the last row of the tree.Example 1:Input: 2 / \ 1 3Output:1Example 2: Input: 1 / \ 2 3原创 2017-05-03 21:34:15 · 327 阅读 · 0 评论 -
leetcode 515. Find Largest Value in Each Tree Row
You need to find the largest value in each row of a binary tree.Example:Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]这一题很简单,BFS就搞定了原创 2017-05-12 13:44:29 · 374 阅读 · 0 评论 -
leetcode 442. Find All Duplicates in an Array
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it without ex原创 2017-05-12 14:33:12 · 390 阅读 · 2 评论 -
leetcode 292. Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the原创 2017-05-04 16:28:04 · 354 阅读 · 0 评论 -
leetcode 406. Queue Reconstruction by Height
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of t原创 2017-05-04 22:00:27 · 437 阅读 · 0 评论 -
leetcode 520. Detect Capital
Given a word, you need to judge whether the usage of capitals in it is right or not.We define the usage of capitals in a word to be right when one of the following cases holds:All letters in t原创 2017-05-14 14:36:30 · 343 阅读 · 0 评论 -
leetcode 495. Teemo Attacking
In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning tim原创 2017-05-14 21:50:07 · 321 阅读 · 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.就喜欢这样简单明了的题干。我用的是BFS广度优先遍历,迭原创 2017-05-15 14:46:49 · 256 阅读 · 0 评论 -
leetcode 508. Most Frequent Subtree Sum
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (includi原创 2017-05-15 15:53:42 · 332 阅读 · 0 评论 -
leetcode 526. Beautiful Arrangement
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position (1 ≤ i原创 2017-05-07 01:09:05 · 622 阅读 · 0 评论 -
leetcode 529. Minesweeper
Let's play the minesweeper game (Wikipedia, online game)!You are given a 2D char matrix representing the game board. 'M' represents an unrevealed mine, 'E' represents an unrevealed empty squar原创 2017-05-15 21:30:54 · 367 阅读 · 0 评论 -
leetcode 389. Find the Difference
Given two strings s and t which consist of only lowercase letters.String t is generated by random shuffling string s and then add one more letter at a random position.Find the letter that was原创 2017-05-16 00:09:41 · 318 阅读 · 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.这道题就让我们看看大神们的方法吧!public int getSum(int a, int b)原创 2017-05-16 01:02:09 · 271 阅读 · 0 评论 -
leetcode 561. Array Partition I
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large a原创 2017-04-25 17:03:07 · 458 阅读 · 0 评论 -
leetcode 537. Complex Number Multiplication
Given two strings representing two complex numbers.You need to return a string representing their multiplication. Note i2 = -1 according to the definition.Example 1:Input: "1+1i", "1+1i"O原创 2017-04-26 00:28:16 · 734 阅读 · 0 评论 -
leetcode 557. Reverse Words in a String III
Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.Example 1:Input: "Let's take LeetCode contes原创 2017-04-26 13:35:31 · 720 阅读 · 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,原创 2017-04-25 21:03:52 · 425 阅读 · 0 评论 -
leetcode 419. Battleships in a Board
Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume the following rules:You receive a valid原创 2017-04-26 20:41:07 · 320 阅读 · 0 评论 -
leetcode 338. 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原创 2017-04-27 11:10:56 · 424 阅读 · 0 评论 -
leetcode 575. Distribute Candies
Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute the原创 2017-05-10 13:12:09 · 359 阅读 · 0 评论 -
leetcode 566. Reshape the Matrix
In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.You're given a matrix represented by a two-dim原创 2017-05-10 14:00:34 · 299 阅读 · 0 评论 -
leetcode 553. Optimal Division
Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.However, you can add any number of parenthesis at any position to change原创 2017-05-10 15:53:41 · 356 阅读 · 0 评论 -
leetcode 462. Minimum Moves to Equal Array Elements II
Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by原创 2017-06-05 21:03:06 · 307 阅读 · 0 评论 -
leetcode 226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1我想法就是用递归,然后引用交换每个结点的左右子树。public class Invert_Binary_Tree_226 { public原创 2017-06-06 20:51:33 · 227 阅读 · 0 评论 -
leetcode 530. Minimum Absolute Difference in BST
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.Example:Input: 1 \ 3 / 2Output:1Explanation:Th原创 2017-06-28 14:37:50 · 383 阅读 · 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原创 2017-06-29 16:54:04 · 285 阅读 · 0 评论 -
leetcode 453. Minimum Moves to Equal Array Elements
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:Input:[1,2,3]Ou原创 2017-06-30 15:44:37 · 269 阅读 · 0 评论 -
leetcode 563. Binary Tree Tilt
Given a binary tree, return the tilt of the whole tree.The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtre原创 2017-06-30 16:19:58 · 453 阅读 · 0 评论 -
leetcode 383. Ransom Note
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; ot原创 2017-06-30 16:43:34 · 253 阅读 · 0 评论 -
leetcode 592. Fraction Addition and Subtraction
Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final result should be irreducible fraction. If your f原创 2017-07-01 14:53:58 · 792 阅读 · 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原创 2017-07-01 15:45:53 · 209 阅读 · 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原创 2017-06-22 16:24:23 · 277 阅读 · 0 评论 -
leetcode 506. Relative Ranks
Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".Example 1:In原创 2017-07-02 14:36:02 · 253 阅读 · 0 评论 -
leetcode 171. Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...原创 2017-07-02 16:37:20 · 317 阅读 · 0 评论 -
leetcode 122. Best Time to Buy and Sell Stock II
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2017-07-02 16:42:38 · 252 阅读 · 0 评论 -
leetcode 387. First Unique Character in a String
Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s = "leetcode"return 0.s = "loveleetcode",return 2.Note:原创 2017-07-02 20:34:47 · 281 阅读 · 0 评论 -
leetcode 477. Total Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Now your job is to find the total Hamming distance between all pairs of the giv原创 2017-07-02 21:15:40 · 377 阅读 · 0 评论