leetcode
catttbao
厦门一中2011级毕业生
东北师大软工2014级本科生
展开
-
Leetcode 605(Java)
Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die.Given a原创 2017-07-27 11:19:58 · 563 阅读 · 0 评论 -
Leetcode 392(Java)
Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, an原创 2017-05-20 22:03:04 · 382 阅读 · 0 评论 -
Leetcode 371(Java)
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.Credits: Special thanks to @fujiaozhu for adding this problem a原创 2017-04-27 12:33:48 · 579 阅读 · 0 评论 -
Leetcode 89(Java)
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray原创 2017-05-17 18:26:28 · 541 阅读 · 0 评论 -
Leetcode 506(Java)
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: Input: [5原创 2017-05-08 18:23:27 · 263 阅读 · 0 评论 -
Leetcode 22(Java)
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:[ “((()))”, “(()())”, “(())()”, “()(())”,原创 2017-05-16 16:17:17 · 466 阅读 · 0 评论 -
Leetcode 575(Java)
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 these原创 2017-05-07 16:15:35 · 406 阅读 · 0 评论 -
Leetcode 409(Java)
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” is not consider原创 2017-05-15 20:58:20 · 630 阅读 · 0 评论 -
Leetcode 566(Java)
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-dimensio原创 2017-05-06 15:57:26 · 471 阅读 · 0 评论 -
Leetcode 400(Java)
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 3Output原创 2017-06-06 14:04:46 · 591 阅读 · 0 评论 -
Leetcode 21(Java)
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.题目很简单有很简短,实际上对于链表的题目很容易想到递归的方法。新建一个头节点,不断拿两个链表的节点比较,谁小就链接上去。原创 2017-06-07 11:07:04 · 1465 阅读 · 0 评论 -
Leetcode 628(Java)
Given an integer array, find three numbers whose product is maximum and output the maximum product.Example 1: Input: [1,2,3] Output: 6 Example 2: Input: [1,2,3,4] Output: 24 Note: The length of原创 2017-07-27 10:27:34 · 448 阅读 · 0 评论 -
Leetcode11(Java)
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原创 2017-08-10 16:14:11 · 305 阅读 · 0 评论 -
Leetcode 645(Java)
The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of on原创 2017-07-30 14:57:26 · 584 阅读 · 0 评论 -
Leetcode 152(Java)
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest produ原创 2017-07-29 18:29:37 · 612 阅读 · 0 评论 -
Leetcode 169&229(Java)
这是两道数组中找元素的题目,229是169的进阶版。先看169。Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty原创 2017-06-10 10:11:45 · 359 阅读 · 0 评论 -
Leetcode 155(Java)
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the原创 2017-06-09 09:49:31 · 657 阅读 · 0 评论 -
Leetcode 151(Java)
Total Accepted: 154413 Total Submissions: 982629 Difficulty: Medium Contributor: LeetCode Given an input string, reverse the string word by word.For example, Given s = “the sky is blue”, return “原创 2017-06-03 18:16:17 · 498 阅读 · 0 评论 -
Leetcode 58(Java)
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 defined as原创 2017-06-02 22:12:18 · 643 阅读 · 0 评论 -
Leetcode 1(Java)
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, and you may not use the same ele原创 2017-05-14 16:24:21 · 270 阅读 · 0 评论 -
Leetcode 463(Java)
Total Accepted: 35307 Total Submissions: 62217 Difficulty: Easy Contributors: amankaraj You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water原创 2017-04-22 10:06:01 · 311 阅读 · 0 评论 -
Leetcode 203(Java)
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 –> 5链表类问题的解决通常要复刻一个链表,建立一个空头。再用两个指针遍历一遍链表,遇到符合的原创 2017-05-13 09:10:40 · 544 阅读 · 0 评论 -
Leetcode 396(Java)
Leetcode 396(Java)原创 2017-04-06 20:56:07 · 394 阅读 · 0 评论 -
Leetcode 225(Java)
Leetcode 225原创 2017-04-08 12:54:52 · 807 阅读 · 0 评论 -
Leetcode 168(Java)
Leetcode 168原创 2017-04-09 21:44:50 · 619 阅读 · 0 评论 -
Leetcode 199(Java)
Leetcode 199原创 2017-04-10 09:57:57 · 512 阅读 · 0 评论 -
Leetcode 240(Java)
Leetcode 240原创 2017-04-10 11:45:54 · 279 阅读 · 0 评论 -
Leetcode 127(Java)
Leetcode 127原创 2017-04-13 21:04:49 · 718 阅读 · 0 评论 -
Leetcode 389(Java)
Leetcode 389原创 2017-04-14 13:53:10 · 347 阅读 · 0 评论 -
LeetCode 116(Java)
为了面试开始做LeetCode的题目,也开始写自己的学习技术blog。虽说有点晚了,但意识到晚了就不算晚。在LeetCode里遇见第一道把我卡住的题目(116)如下:Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; Tre原创 2016-07-13 17:29:00 · 869 阅读 · 0 评论 -
Leetcode 543(Java)
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may no原创 2017-04-05 13:08:40 · 668 阅读 · 0 评论 -
Leetcode 448(Java)
Leetcode 448原创 2017-04-07 11:04:49 · 609 阅读 · 0 评论 -
Leetcode 404(Java)
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.sum为所以左枝叶子结点原创 2017-05-12 08:55:46 · 674 阅读 · 0 评论 -
Leetcode 387(Java)
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: You may assume原创 2017-04-17 12:20:29 · 340 阅读 · 0 评论 -
Leetcode 112&113&437(Java)
今天来总结一下Leetcode上目前我做到关于Path Sum即二叉树求和的内容,涉及的题目有三道,题号为112(easy),113(medium),437(easy)。Leetcode 112Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the原创 2017-04-15 22:24:31 · 530 阅读 · 0 评论 -
Leetcode 475(Java)
Leetcode 475原创 2016-10-10 09:37:16 · 441 阅读 · 0 评论 -
Leetcode 461(Java)
leetcode 461原创 2016-10-12 15:39:01 · 334 阅读 · 0 评论 -
Leetcode 179(Java)
Leetcode 179原创 2017-04-02 15:52:20 · 675 阅读 · 0 评论 -
Leetcode 530(Java)
Leetcode 530原创 2017-04-03 21:22:53 · 582 阅读 · 0 评论 -
Leetcode 3(Java)
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原创 2017-04-04 21:30:36 · 838 阅读 · 0 评论