- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode_5 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.这是一个最长回文子序列的问题，有以下几种解法1.动态规划我在做题时是用这种解法，时间复杂度为o(n^2)。式子不难列出：dp[i][j] = s[i]==s[j] &&
2017-02-19 17:39:26
369
原创 LeetCode 2. Add Two Numbers
原题题目： You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and ret
2017-02-09 22:23:44
392
原创 238. Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Solve it without division and in O(n). For
2017-02-06 18:30:11
222
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人