leetcode_Java
棒棒666
坚持
展开
-
Leetcode205. 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 cha原创 2016-12-31 21:24:22 · 176 阅读 · 0 评论 -
Leetcode415. Add Strings
原题Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100.Both num1 and num2 contains only digits 0-9.Both原创 2017-01-02 15:50:52 · 196 阅读 · 0 评论 -
Leetcode217. 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 el原创 2016-11-27 22:00:17 · 136 阅读 · 0 评论 -
Leetcode409. Longest Palindrome
一、题目Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example "Aa"原创 2016-11-27 16:42:29 · 211 阅读 · 0 评论 -
Leetcode242. 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:Y原创 2016-11-27 15:56:33 · 169 阅读 · 0 评论 -
Leetcode383. 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 maga原创 2016-11-26 22:25:47 · 219 阅读 · 0 评论 -
Leetcode387. 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.原创 2016-11-27 11:54:20 · 153 阅读 · 0 评论 -
Leetcode292. 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原创 2016-11-26 19:25:53 · 183 阅读 · 0 评论 -
Leetcode455. Assign Cookies
一、原题Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum siz原创 2016-11-26 20:26:15 · 271 阅读 · 0 评论 -
Leetcode453. 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:[原创 2016-11-26 21:27:56 · 185 阅读 · 0 评论 -
Leetcode171. Excel Sheet Column Number
一、原题Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28原创 2016-11-26 16:01:31 · 168 阅读 · 0 评论 -
Leetcode412. 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 outpu原创 2016-11-26 19:08:11 · 192 阅读 · 0 评论 -
Leetcode14. Longest Common Prefix
一、原题Write a function to find the longest common prefix string amongst an array of strings.编写一个函数来查找字符串数组中最长的公共前缀字符串。二、解题思路1、先得到字串串数组中最短的字符串长度(公共前缀字符串的长度一定是小于最短字符串长度)2、从字符串数组的第一个元素的第一个字符开原创 2016-11-26 14:33:26 · 234 阅读 · 0 评论 -
String,StringBuffer与StringBuilder的区别??
String 字符串常量 StringBuffer 字符串变量(线程安全) StringBuilder 字符串变量(非线程安全) 简要的说, String 类型和 StringBuffer 类型的主要性能区别其实在于 String 是不可变的对象, 因此在每次对 String 类型进行改变的时候其实都等同于生成了一个新的 String 对象,然后将指针指向新的 String 对象,所以经常改转载 2017-01-02 16:01:17 · 249 阅读 · 0 评论 -
Leetcode118. 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-12-22 21:57:25 · 220 阅读 · 0 评论 -
Leetcode94. Binary Tree Inorder Traversal
原题Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2]题意 中序遍历,将结果返回到list集合中 思路 采用栈的方式,遍历到的节原创 2017-01-03 14:04:46 · 193 阅读 · 0 评论 -
Leetcode290. 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.Examples:原创 2016-12-31 21:56:06 · 235 阅读 · 0 评论 -
Leetcode203. 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题意 给出一个链表和一个目标值,删除链表中与目标值相同的元素,然原创 2016-12-31 15:34:38 · 187 阅读 · 0 评论 -
Leetcode35. Search Insert Position
原题Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Her原创 2016-12-28 17:30:23 · 193 阅读 · 0 评论 -
leetcode69. Sqrt(x)
原题 Implement int sqrt(int x). Compute and return the square root of x. 计算出x的开方的数组 思路 利用二分查找法,如果mid的乘方大于x,但是mid+1的乘方小于x就说明mid是x的开方的整数值。 但是在写的过程中,如果x的数值较大,mid的数值较大,可能会造成mid的平方过大做成数值溢出,所以可以换个角度来比较,乘原创 2016-12-28 17:25:30 · 363 阅读 · 0 评论 -
Leetcode 184. Department Highest Salary
利用SQL语句找出每一个部门中工资最高的人的信息 原题 The Employee table holds all employees. Every employee has an Id, a salary, and there is also a column for the department Id.+----+-------+--------+--------------+| Id |原创 2017-01-04 21:14:42 · 676 阅读 · 0 评论 -
Leetcode151. Reverse Words in a String
原题 Given an input string, reverse the string word by word.For example, Given s = “the sky is blue”, return “blue is sky the”.Update (2015-02-12): For C programmers: Try to solve it in-place in O(1)原创 2016-12-27 17:19:35 · 251 阅读 · 0 评论 -
Leetcode177. Nth Highest Salary(SQL语句中使用函数)
原题 Write a SQL query to get the nth highest salary from the Employee table.+----+--------+| Id | Salary |+----+--------+| 1 | 100 || 2 | 200 || 3 | 300 |+----+--------+For example, g原创 2017-01-04 20:38:28 · 379 阅读 · 0 评论 -
Leetcode176. Second Highest Salary(MYSQL limit,offset 区别)
原题 Write a SQL query to get the second highest salary from the Employee table.+----+--------+| Id | Salary |+----+--------+| 1 | 100 || 2 | 200 || 3 | 300 |+----+--------+For example原创 2017-01-04 17:08:31 · 345 阅读 · 0 评论 -
Leetcode16. 3Sum Closest
原题 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exac原创 2016-12-25 17:14:59 · 183 阅读 · 0 评论 -
Leetcode345. Reverse Vowels of a String
原题 Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.Note: The vo原创 2016-12-25 17:01:40 · 243 阅读 · 0 评论 -
Leetcode15. 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.For example, given array S = [-1, 0, 1, 2,原创 2016-12-25 12:05:47 · 218 阅读 · 0 评论 -
Leetcode338. 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 you s原创 2017-01-03 14:39:30 · 229 阅读 · 0 评论 -
Leetcode349. 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 re原创 2016-11-26 15:47:18 · 208 阅读 · 0 评论 -
Leetcode283. 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 y原创 2016-11-26 15:32:21 · 198 阅读 · 0 评论 -
Leetcode20. 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 valid b原创 2016-12-10 19:13:18 · 156 阅读 · 0 评论 -
Leetcode121. Best Time to Buy and Sell Stock
题目 Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2016-12-01 10:41:10 · 293 阅读 · 0 评论 -
Leetcode172. Factorial Trailing Zeroes
题目 Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity. 思路 给出一个整数n,计算n的阶乘的结果,有多少个0 如果计算阶乘,然后再计算结果中有多少个0时,容易造成数据过大溢出;可以换个角度考虑,原创 2016-11-30 16:58:55 · 171 阅读 · 0 评论 -
Leetcode219. 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-11-30 11:31:39 · 309 阅读 · 0 评论 -
Leetcode219. 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-11-30 10:19:02 · 164 阅读 · 0 评论 -
Leetcode88. Merge Sorted Array
一、题目Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to原创 2016-11-29 21:19:54 · 160 阅读 · 0 评论 -
Leetcode27. 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 m原创 2016-11-29 14:18:00 · 135 阅读 · 0 评论 -
Leetcode26. 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原创 2016-11-29 13:52:14 · 136 阅读 · 0 评论 -
Leetcode1. 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:Gi原创 2016-11-28 22:06:33 · 152 阅读 · 0 评论 -
Leetcode414. 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:Inp原创 2016-11-28 21:25:03 · 211 阅读 · 0 评论