shuaijiang's blog
  • 首页
  • 归档
  • 分类
  • 标签
  • 关于

LeetCode Longest Palindromic Substring

DescriptionGiven 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. The original p
7月 26 2015
#leetcode

LeetCode String To Integer

DescriptionImplement atoi to convert a string to an integer. The original problem is here. The original code is here.
7月 26 2015
#leetcode

LeetCode 4 Sum

DescriptionGiven an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target. Note:Element
7月 26 2015
#leetcode

LeetCode 3 Sum Closest

DescriptionGiven 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 h
7月 25 2015
#leetcode

LeetCode 3 Sum

DescriptionGiven 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. Note:Elements in a triplet (a,b,c
7月 25 2015
#leetcode

LeetCode Path Sum2

DescriptionGiven a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum. For example:Given the below binary tree and sum = 22, 5 / \
7月 24 2015
#leetcode

LeetCode Evaluate Reverse Polish Notation

DescriptionEvaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some examples: ["2"
7月 24 2015
#leetcode

LeetCode Next Permutation

DescriptionImplement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest
7月 24 2015
#leetcode

LeetCode Reverse Nodes In K Group

DescriptionGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain
7月 23 2015
#leetcode

LeetCode Sliding Window Maximum

DescriptionGiven an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the slidi
7月 23 2015
#leetcode
1…910111213…26

搜索

Hexo Fluid
总访问量 次 总访客数 人