lk1009115563的博客

按照最长递增子序列的思路dp class Solution { public int longestSubsequence(int[] arr, int difference) { // dp[i]: arr[0~i] 中且以i结尾的最长定差子序列 int dp[] = new int[arr.length]; dp[0] = 1; int res = 1; for (int i = 1; i < arr.

题目; 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 answ

题目：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 sa

题目：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

题目：Determine whether an integer is a palindrome. Do this without extra space. 转成字符串，使用额外空间的解法。注意-123321应返回false public boolean isPalindrome(int x) { String string = ""+x; for(int i=0;i<s

题目： Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Note: The input is assumed to be a 32-bit signed integer. Your f