LeetCode OJ
文章平均质量分 70
Rookie_Feng
好记性不如“烂笔头”
展开
-
leetCode—Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.问题描述:给出一个字符串,求出这个字原创 2015-08-07 22:04:19 · 301 阅读 · 0 评论 -
LeetCode—数组(3)
1.Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chose原创 2015-08-01 16:46:44 · 294 阅读 · 0 评论 -
LeetCode—数组(1)
声明:写这篇博文主要是记录自己刷leetcode oj的情况,也方便自己以后随时查阅复习,在刷题的过程中,有借鉴了别人好的思想,自己绝对没有抄袭的意图。特此声明。未完,会在以后不断更新1.2Sum Description:Given an array of integers, find two numbers such that they add up to a speci原创 2015-07-22 14:51:38 · 384 阅读 · 0 评论 -
LeetCode—买卖股票的最好时机
1.Best Time to Buy and Sell StockDescription: 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 transac原创 2015-08-17 17:06:23 · 1051 阅读 · 0 评论 -
LeetCode—Isomorphic Strings
DescriptionGiven 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.ExampleGiven "egg", "add", return原创 2015-07-20 15:55:18 · 282 阅读 · 0 评论 -
LeetCode—Longest Common Prefix
Description:Write a function to find the longest common prefix string amongst an array of strings.public static String longestCommonPrefix(String[] strs) { if(strs==null||strs.length==0)原创 2015-07-20 16:47:33 · 228 阅读 · 0 评论 -
LeetCode—Two Sum
Description:Given an array of integers, find two numbers such that they add up to a specific target number.(给你一个数组,找出两个数(返回这个两个数的下标(从1开始)),使得两个数的和等于指定的数)ExampleInput: numbers={2, 7, 11, 15}, tar原创 2015-07-20 15:32:47 · 248 阅读 · 0 评论 -
LeetCode—二叉树的最大最小深度
1.二叉树的最大深度这个题目就是求二叉树的高度,实现起来很容易。代码如下:/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-08-12 13:59:14 · 391 阅读 · 0 评论 -
LeetCode—二叉树的建立
1.Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in t原创 2015-08-01 16:49:40 · 914 阅读 · 0 评论 -
LeetCode—删除数组元素
1.删除元素给定一个数组和一个值,在原地删除与值相同的数字,返回新数组的长度。元素的顺序可以改变,并且对新的数组不会有影响。样例:给出一个数组 [0,4,4,0,0,2,4,4],和值 4返回 4 并且4个元素的新数组为[0,0,0,2]代码如下: public int removeElement(int[] A, int elem) {原创 2015-08-11 16:38:04 · 654 阅读 · 0 评论 -
LeetCode—数组(2)
1.Two SumDescription: Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that th原创 2015-08-01 16:38:29 · 280 阅读 · 0 评论 -
LeetCode—Count Primes
Description:Count the number of prime numbers less than a non-negative number, n.就是求小于非负整数n的质素的个数(质数:只能被自己和1整除的整数)。public int countPrimes(int n) { if(n==0) return 0; if(n==1) retu原创 2015-07-20 15:31:18 · 233 阅读 · 0 评论 -
LeetCode—Implement strStr()
Description:Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.(判断字符串p是不是s的一个子串)。首先,我们一定会想到使用暴力法解决这个问题。思路很简单,假设现在文本串S匹配到 i 位置,模式串P匹配到 j 位置,则有:原创 2015-07-21 10:44:58 · 237 阅读 · 0 评论 -
LeetCode—二叉树的遍历
1.二叉树的前序遍历给出一棵二叉树,返回其节点值的前序遍历。样例给出一棵二叉树 {1,#,2,3}, 1 \ 2 / 3 返回 [1,2,3].代码:/** * Definition of TreeNode: * public class TreeNode { * public in原创 2015-08-08 18:09:23 · 524 阅读 · 0 评论