LeetCode
杜鲁门
keep moving
展开
-
[LeetCode]--190. Reverse Bits(不是很懂的位运算)
补充知识,Java的位运算(bitwise operators)Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represe原创 2016-10-08 23:43:40 · 783 阅读 · 0 评论 -
[LeetCode]--191. Number of 1 Bits
Write 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 binary representation 0000000000000原创 2016-10-09 09:14:00 · 662 阅读 · 0 评论 -
[LeetCode]--198. House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses原创 2016-10-09 10:53:49 · 749 阅读 · 0 评论 -
[LeetCode]--202. Happy Number
Write 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 sum of the squares of i原创 2016-10-10 20:49:05 · 576 阅读 · 0 评论 -
[LeetCode]--203. Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5Credits: Special thanks to @mithmatt for a原创 2016-10-11 00:27:14 · 626 阅读 · 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.public int countPrimes(int n)原创 2016-10-11 09:57:33 · 769 阅读 · 0 评论 -
[LeetCode]--205. Isomorphic Strings(同构字符串)
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with another chara原创 2016-10-11 15:24:47 · 1326 阅读 · 0 评论 -
[LeetCode]--206. Reverse Linked List
Reverse a singly linked list.click to show more hints.Hint: A linked list can be reversed either iteratively or recursively. Could you implement both?贴个递归代码,一次Accept。public ListNode reverseList(ListNo原创 2016-10-11 15:39:54 · 706 阅读 · 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-10-11 16:46:13 · 648 阅读 · 0 评论 -
[LeetCode]--219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.想法:这题比较简单,可原创 2016-10-11 17:28:44 · 592 阅读 · 0 评论 -
[LeetCode]--223. Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle Area Assume that the t原创 2016-10-11 23:02:06 · 642 阅读 · 0 评论 -
[LeetCode]--47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example, [1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1]][Le原创 2016-11-03 08:41:47 · 322 阅读 · 0 评论 -
[LeetCode]--48. Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up: Could you do this in-place?本地使得二维矩阵,旋转90角度。通过实际数据分析,通过两个步骤的元素交换可实现目标:按照主对角线,将对称元素交换 按照列,将对原创 2016-11-03 14:39:57 · 342 阅读 · 0 评论 -
[LeetCode]--11. Container With Most Water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin原创 2016-10-23 10:37:19 · 445 阅读 · 0 评论 -
[LeetCode]--12. Integer to Roman
[LeetCode]–13. Roman to Integer可以在上面的链接看一下罗马数字的排列规律。然后利用规律,构建数组,把基本的构建数放在数组里面,然后依次判断加进去就行。public class Solution { public String intToRoman(int num) { String[][] roman = { {原创 2016-10-23 11:26:57 · 487 阅读 · 0 评论 -
[LeetCode]--49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: All inputs will原创 2016-11-03 16:50:24 · 300 阅读 · 0 评论 -
[LeetCode]--15. 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain duplic原创 2016-10-23 17:34:03 · 537 阅读 · 0 评论 -
[LeetCode]--225. Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. empty() – Return whether原创 2016-10-13 08:58:09 · 692 阅读 · 0 评论 -
[LeetCode]--50. Pow(x, n)
Implement pow(x, n).其实这个题递归和非递归应该都不难实现,就是边界值的问题。public double myPow(double x, int n) { if (n == 0) return 1.0; double res = 1.0; if (n < 0) { if (x >= 1.原创 2016-11-03 22:06:09 · 298 阅读 · 0 评论 -
[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 Howell: G原创 2016-10-13 16:21:08 · 556 阅读 · 0 评论 -
[LeetCode]--53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the原创 2016-11-04 11:17:21 · 360 阅读 · 0 评论 -
[LeetCode]--231. Power of Two
Given an integer, write a function to determine if it is a power of two.Credits: Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.如果是power of two, 则2进制表达中,有且仅原创 2016-10-13 17:20:40 · 615 阅读 · 0 评论 -
[LeetCode]--232. Implement Queue using Stacks
Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front element. empty()原创 2016-10-13 18:03:50 · 582 阅读 · 0 评论 -
[LeetCode]--234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?我的思路很简单,先遍历一遍找到长度,然后用堆保存着前面一半的数据然后与后面的对比,不一样就false。/** * Definition for singly-linke原创 2016-10-13 22:00:42 · 569 阅读 · 0 评论 -
[LeetCode]--17. Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string "23"O原创 2016-10-24 21:13:52 · 501 阅读 · 0 评论 -
[LeetCode]--54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You should原创 2016-11-04 17:21:18 · 497 阅读 · 0 评论 -
[LeetCode]--55. Jump Game
Given 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 position.Determine if you are原创 2016-11-04 22:02:54 · 351 阅读 · 0 评论 -
[LeetCode]--235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two原创 2016-10-14 11:04:35 · 550 阅读 · 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 value 3, t原创 2016-10-14 11:52:42 · 606 阅读 · 0 评论 -
[LeetCode]--242. Valid Anagram
Given 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.Note: You may assume the s原创 2016-10-14 13:34:44 · 658 阅读 · 0 评论 -
[LeetCode]--257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:[“1->2->5”, “1->3”] Credits: Special thanks to @j原创 2016-10-14 16:14:02 · 581 阅读 · 0 评论 -
[LeetCode]--59. Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example, Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5原创 2016-11-05 10:29:29 · 329 阅读 · 0 评论 -
[LeetCode]--60. Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order, We get the following sequence (ie, for n = 3):1."123"2."132"3."213"4."231"5原创 2016-11-05 11:00:14 · 271 阅读 · 0 评论 -
[LeetCode]--46. Permutations
Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]][Leet原创 2016-11-02 22:04:56 · 428 阅读 · 0 评论 -
[LeetCode]--6. ZigZag Conversion
The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H N A P L S原创 2016-09-27 14:52:40 · 570 阅读 · 0 评论 -
[LeetCode]--7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321我的第一感觉我就要把它弄成字符串,然后一下子弄出来,结果也实现了,可是超时了。public int reverse(int x) { String str = x + ""; String原创 2016-09-28 08:13:35 · 552 阅读 · 0 评论 -
[LeetCode]--8. String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.N原创 2016-09-28 23:18:00 · 750 阅读 · 0 评论 -
[LeetCode]--3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le原创 2016-09-27 08:49:48 · 698 阅读 · 0 评论 -
[LeetCode]--2. Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linke原创 2016-09-26 22:56:40 · 657 阅读 · 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 = [2, 7, 11,原创 2016-09-26 22:52:51 · 617 阅读 · 0 评论