LeetCode
狂浪贵公子
这个作者很懒,什么都没留下…
展开
-
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.Assume that the tota原创 2016-03-29 15:22:10 · 213 阅读 · 0 评论 -
LeetCode 190 Reverse Bits
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as0011100101原创 2016-03-29 15:59:07 · 257 阅读 · 0 评论 -
LeetCode 58 Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last word does not exist, return 0.Note: A word is原创 2016-03-29 17:43:39 · 199 阅读 · 0 评论 -
LeetCode 19 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2016-03-30 01:38:30 · 201 阅读 · 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 anot原创 2016-03-29 17:35:39 · 197 阅读 · 0 评论 -
LeetCode 290 Word Pattern
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.原创 2016-03-30 11:50:34 · 197 阅读 · 0 评论 -
LeetCode 38 Count and Say
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2016-03-30 15:16:56 · 195 阅读 · 0 评论 -
LeetCode 203 Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --> 3 --> 4 --> 5 public ListNode removeE原创 2016-03-30 15:59:33 · 218 阅读 · 0 评论 -
LeetCode 14 Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. public String longestCommonPrefix(String[] strs) { if (strs.length == 0) return ""; if (strs.length == 1)原创 2016-03-30 16:50:39 · 187 阅读 · 0 评论 -
LeetCode 67 Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".参考了https://github.com/soulmachine/leetcode public String addBinary(String a, S原创 2016-03-31 10:20:43 · 197 阅读 · 0 评论 -
LeetCode 28 Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.对于这个题目,JAVA封装的有现成的方法,一句话搞定。 public int strStr(String haystack, Strin原创 2016-03-31 11:18:34 · 174 阅读 · 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-03-31 15:37:29 · 180 阅读 · 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 count原创 2016-03-31 16:36:14 · 341 阅读 · 1 评论 -
LeetCode 228 Summary Ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. public List summaryRanges(int[] nums) { List r原创 2016-03-31 21:42:43 · 211 阅读 · 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 NA P L S I原创 2016-04-01 15:00:44 · 233 阅读 · 0 评论 -
LeetCode 7 Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before c原创 2016-04-01 16:07:14 · 184 阅读 · 0 评论 -
LeetCode 278 First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the原创 2016-04-03 23:04:25 · 199 阅读 · 0 评论 -
LeetCode 328 Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in原创 2016-03-21 15:56:27 · 285 阅读 · 0 评论 -
LeetCode 70 Climbing Stairs
You 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?递归导致超时,所以非递归。 pub原创 2016-03-21 19:17:16 · 244 阅读 · 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 sinc原创 2016-03-22 10:22:45 · 211 阅读 · 0 评论 -
LeetCode 83 Remove Duplicates from Sorted List
Given 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, return 1->2->3.注意 1->1->1-原创 2016-03-21 16:24:24 · 196 阅读 · 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.小数字在大数字前面表示的数是用大数字减去小数字,如 IV=4;小数字在大数字后面表示的数是用大数字加上小数字,如VII=7; publi原创 2016-03-17 17:46:07 · 216 阅读 · 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 betw原创 2016-03-18 17:50:50 · 228 阅读 · 0 评论 -
LeetCode 165 Compare Version Numbers
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2016-04-04 23:01:44 · 165 阅读 · 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 ca原创 2016-04-05 00:42:27 · 273 阅读 · 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-04-01 17:56:07 · 172 阅读 · 0 评论 -
LeetCode 231 Power of Two
Given an integer, write a function to determine if it is a power of two.public boolean isPowerOfTwo(int n) { return n>0 && (n&(n-1))==0; }原创 2016-03-22 23:18:57 · 245 阅读 · 0 评论 -
LeetCode 21 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.这道题目这么简单,在学校的时候是基本题目,现在居然写错。汗颜。AC代码如下:/** * De原创 2016-03-23 10:05:09 · 197 阅读 · 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.解题: 用递归遍历就可以原创 2016-03-13 15:07:52 · 224 阅读 · 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-03-23 11:31:47 · 224 阅读 · 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原创 2016-03-22 16:40:36 · 278 阅读 · 0 评论 -
LeetCode 326 Power of Three
Given 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?Given an integer, write a function to determine if it i原创 2016-03-22 22:58:18 · 235 阅读 · 0 评论 -
LeetCode 66 Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.题意就是:一个十进制数n以位放在数组里面原创 2016-03-24 10:11:51 · 182 阅读 · 0 评论 -
LeetCode 118 Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]对于杨辉三角,前两行不太会处理,只能采用最原创 2016-03-24 17:10:25 · 194 阅读 · 0 评论 -
LeetCode 119 Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use only O(k) extra space? publi原创 2016-03-24 17:59:38 · 168 阅读 · 0 评论 -
LeetCode 20 Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2016-03-25 17:27:10 · 225 阅读 · 0 评论 -
LeetCode 27 Remove Element
Given 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 constant memory.原创 2016-03-23 18:01:08 · 259 阅读 · 0 评论 -
LeetCode 24 Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y原创 2016-04-06 09:01:44 · 181 阅读 · 0 评论 -
LeetCode 26 Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-03-23 22:41:00 · 192 阅读 · 0 评论 -
LeetCode 258 Add Digits 数字相加,数字根
给定一个非负整型数字,重复相加其所有的数字直到最后的结果只有一位数。例如:给定sum = 38,这个过程就像是:3 + 8 = 11,1 + 1 = 2,因为2只有一位数,所以返回它。紧接着:你可以4不用循环或递归在O(1)时间内完成它吗?原文Given a non-negative integer num, repeatedly add all its digits原创 2016-03-13 12:48:54 · 366 阅读 · 0 评论