LeetCode
文章平均质量分 55
Love_Taylor
莫言君行早,更有早行人
展开
-
506. Relative Ranks
Given scores of N athletes,find their relative ranks and the people with the top three highest scores, whowill be awarded medals: "Gold Medal", "Silver Medal" and"Bronze Medal".Example 1:Input: [5原创 2017-03-06 22:34:15 · 251 阅读 · 0 评论 -
125. Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a pa原创 2017-03-28 16:05:50 · 285 阅读 · 0 评论 -
441. Arranging Coins
You have a totalof n coins that you want to form in a staircase shape, where every k-th rowmust have exactly k coins.Given n, findthe total number of full staircase rows that can be formed.n is an原创 2017-03-28 16:51:21 · 485 阅读 · 0 评论 -
198. House Robber
You are a professional robber planning torob 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 adjacenthouses h原创 2017-03-22 09:41:39 · 317 阅读 · 0 评论 -
367. Valid Perfect Square
分析:题目直接是判断一个整数是否是一个完全平方数。方法比较多,以前一直只知道方法一方法一,从1到num/2遍历:boolean flag=false; if(num==1) return true; for(int i=2;i if(i*i==num){ flag原创 2017-03-22 10:05:19 · 235 阅读 · 0 评论 -
27. Remove Element
Given an array and a value, remove allinstances of that value in place and return the new length.Do not allocate extra space for anotherarray, you must do this in place with constant memory.The or原创 2017-03-22 10:27:51 · 224 阅读 · 0 评论 -
69. Sqrt(x)
求一个数的平方根,答案是利用二叉搜索树写的,代码如下:public class Solution { public int mySqrt(int x) { if(x==0) return 0; int left=1,right=Integer.MAX_VALUE;while(true){int mid=left+(right-left)/2原创 2017-04-07 17:03:49 · 402 阅读 · 0 评论 -
144. Binary Tree Preorder Traversal
二叉树的先序遍历,将每个节点中值保存在集合中,并返回,递归和递归两种方法: 方法一:利用二叉树的先序遍历,代码如下:public class Solution { public List preorderTraversal(TreeNode root) { List ls=new ArrayList(); vist(root,ls);原创 2017-03-23 15:39:13 · 274 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal
二叉树的中序遍历,将每个节点中值保存在集合中,并返回,递归和递归两种方法:方法一:利用二叉树的中序遍历,代码如下:public class Solution { public List inorderTraversal(TreeNode root) { List ls=new ArrayList(); inorderVisit(root,ls);原创 2017-03-23 16:12:25 · 288 阅读 · 0 评论 -
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原创 2017-03-28 15:37:17 · 267 阅读 · 0 评论 -
338. Counting Bits
Given a non negative integernumber num. For every numbers i in the range 0≤ i ≤ num calculate the number of 1's in their binaryrepresentation and return them as an array.Example:For num = 5 yo原创 2017-03-11 19:45:02 · 413 阅读 · 0 评论 -
455. Assign Cookies
Assume you are an awesomeparent and want to give your children some cookies. But, you should give eachchild at most one cookie. Each child i has a greed factor gi, which is the minimum size of a coo原创 2017-03-07 22:33:57 · 182 阅读 · 0 评论 -
459. Repeated Substring Pattern
Given a non-empty string checkif it can be constructed by taking a substring of it and appending multiplecopies of the substring together. You may assume the given string consists oflowercase Englis原创 2017-03-20 15:04:19 · 249 阅读 · 0 评论 -
21. Merge Two Sorted Lists
Merge two sorted linked lists and return it asa new list. The new list should be made by splicing together the nodes of thefirst two lists. 翻译:将两个排好序的链表进行排序,要求排好序的链表按照升序排列 分析:由于链表排好序,直接将两个链表原创 2017-03-20 15:41:11 · 238 阅读 · 0 评论 -
122. Best Time to Buy and Sell Stock II
Say you have an array forwhich the ith element is the price of a given stock on day i.Design an algorithm to findthe maximum profit. You may complete as many transactions as you like (ie, buyone and原创 2017-03-10 16:00:48 · 183 阅读 · 0 评论 -
100. Same Tree
判断两颗二叉树是否相等,没有什么好说的。比较每个节点的值是否相等,递归调用。 先写递归结束条件 一、若两个节点都为空,则返回返回true 二、若只有一个节点为空,则返回false 三、若节点都不为空,则比较节点的值是否相等,相等就比较对应左子树和右子数的结果相与 四、否则为false代码如下:/** * Definition for a原创 2017-03-10 17:16:04 · 200 阅读 · 0 评论 -
167. Two Sum II - Input array is sorted
Given an array of integersthat is already sorted in ascending order, find two numbers such that they addup to a specific target number.The function twoSum shouldreturn indices of the two numbers suc原创 2017-03-07 14:39:01 · 193 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST
Given a binary search treewith non-negative values, find the minimum absolute difference between valuesof any two nodes. 谷歌翻译:给定具有非负值的二叉搜索树,找到任意两个节点的值之间的最小绝对差。 首先说一下二叉搜索树,就是二叉排序树。二叉排序树的查找过程和原创 2017-03-07 15:08:00 · 306 阅读 · 0 评论 -
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 t原创 2017-03-11 10:50:26 · 177 阅读 · 0 评论 -
401. Binary Watch
A binary watch has 4 LEDs onthe top which represent the hours (0-11), and the 6 LEDs on the bottomrepresent the minutes (0-59).Each LED represents a zero orone, with the least significant bit on the原创 2017-03-11 11:22:09 · 186 阅读 · 0 评论 -
145. Binary Tree Postorder Traversal
/** *Definition for a binary tree node. *public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution原创 2017-03-23 16:22:04 · 278 阅读 · 0 评论 -
171. Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number. 翻译:如果列表标题显示在Excel工作表中,则返回其相应的列编号。题目的例子举得不好,我重新写一下A 1B 2AA 27AB 28...AAA 703ABA 729题目不难,就是原创 2017-03-14 08:57:58 · 421 阅读 · 0 评论 -
206. Reverse Linked List
这题就是数据结构中链表的逆序,不难。代码如下:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class So原创 2017-03-15 19:13:03 · 239 阅读 · 0 评论 -
118. Pascal's Triangle
Given numRows, generate the first numRowsof Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]] 分析:题目意思就是打印一个杨辉三角。但是不是用原创 2017-03-25 16:59:22 · 229 阅读 · 0 评论 -
434. Number of Segments in a String
Count the number of segments in a string,where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does notcontain any non-printable characters. Ex原创 2017-03-25 17:31:09 · 257 阅读 · 0 评论 -
415. Add Strings
Given two non-negative integers num1 andnum2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is Both num1 and num2 contains only digits0-9.Both num原创 2017-03-25 19:27:21 · 366 阅读 · 0 评论 -
189. Rotate Array
Rotate an array of n elements to the rightby k steps.For example, with n = 7 and k = 3, thearray [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4]. 翻译:一个数组经过k步实现转换 分析:想了两种方法,第一循环右移三位、第二,先全部反转,原创 2017-03-25 20:48:28 · 307 阅读 · 0 评论 -
350. Intersection of Two Arrays II
Given two arrays, write a function tocompute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2],return [2, 2]. 给出亮给数组,求出他的交集。题目不难,可以用集合,但是要注意集合中判断元素是否存在的时候,要注意一下。适当的设置一下map原创 2017-03-16 16:31:04 · 251 阅读 · 0 评论 -
268. Missing Number
Given an array containing n distinctnumbers taken from 0, 1, 2, ..., n, find the one that is missing from thearray.For example,Given nums = [0, 1, 3] return 2. Note:Your algorithm should run i原创 2017-03-16 16:52:10 · 222 阅读 · 0 评论 -
532. K-diff Pairs in an Array
Given an array of integers and an integerk, you need to find the number of unique k-diff pairs in the array. Here ak-diff pair is defined as an integer pair (i, j), where i and j are bothnumbers in th原创 2017-04-04 09:57:24 · 503 阅读 · 0 评论 -
150. Evaluate Reverse Polish Notation
Evaluate the value of anarithmetic expression in Reverse Polish Notation.Valid operators are +, -, *,/. Each operand may be an integer or another expression.Some examples: ["2", "1", "+","3", "原创 2017-03-15 18:36:19 · 216 阅读 · 0 评论 -
101. Symmetric Tree
Given a binary tree, check whether it is amirror of itself (ie, symmetric around its center).For example, this binary tree[1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 44原创 2017-03-24 15:28:53 · 264 阅读 · 0 评论 -
414. Third Maximum Number
Given a non-empty array of integers, returnthe third maximum number in this array. If it does not exist, return themaximum number. The time complexity must be in O(n). 翻译:给一个非空的数组,求第三大的数。若不存在返回最大原创 2017-03-31 16:55:39 · 259 阅读 · 0 评论 -
541. Reverse String II
Given a string and an integer k, you need toreverse the first k characters for every 2k characters counting from the startof the string. If there are less than k characters left, reverse all of them原创 2017-03-14 10:33:43 · 1341 阅读 · 0 评论 -
237. Delete Node in a Linked List
链表的删除问题,很简单的题目。就是删除指定节点,且这个节点不是尾节点。由于没有给出前面的节点,所以相当于直接将后面的值拿出来,然后删除后一个节点。代码如下:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * L原创 2017-03-14 10:46:17 · 248 阅读 · 0 评论 -
169. Majority Element
Given an array of size n, findthe majority element. The majority element is the element that appears morethan⌊n/2 ⌋times.You may assume that the arrayis non-empty and the majority element always原创 2017-03-14 11:29:12 · 264 阅读 · 0 评论 -
168. Excel Sheet Column Title
Given a positiveinteger, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA28 -> AB 翻译:给定一个原创 2017-03-31 10:23:13 · 516 阅读 · 0 评论 -
409. Longest Palindrome
Given a string which consistsof lowercase or uppercase letters, find the length of the longest palindromesthat can be built with those letters. This is case sensitive, forexample "Aa" is not conside原创 2017-03-14 22:20:32 · 225 阅读 · 0 评论 -
217. Contains Duplicate
Given an array of integers,find if the array contains any duplicates. Your function should return true ifany value appears at least twice in the array, and it should return false ifevery element is原创 2017-03-14 23:18:38 · 203 阅读 · 0 评论 -
204. Count Primes
Count the number of prime numbers less than anon-negative number, n. 翻译:找出不打于n的所有非负数的素数。 分析:素数是只能被1和自己整数的数。一般常规方法运行都会超时,这里有一种方式解决,设置一个标记位,直 接将n的所有可能的非素数标记出来,这样的时间复杂度是线性的。代码如下:public原创 2017-03-31 11:00:56 · 345 阅读 · 0 评论