Aug 27, 2022 · Aug 20, 2022 · Aug 20, 2022 · Aug 20, 2022 · Aug 20, 2022 · Aug 27, 2022
diff --git a/problems/0005.最长回文子串.md b/problems/0005.最长回文子串.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -263,21 +263,39 @@ public:
		Java:

		```java
	public int[] twoSum(int[] nums, int target) {
	int[] res = new int[2];
	if(nums == null \|\| nums.length == 0){
	return res;
	}
	Map<Integer, Integer> map = new HashMap<>();
	for(int i = 0; i < nums.length; i++){
	int temp = target - nums[i];
	if(map.containsKey(temp)){
	res[1] = i;
	res[0] = map.get(temp);
	// 双指针动态规划
	class Solution {
	public String longestPalindrome(String s) {
	if (s.length() == 0 \|\| s.length() == 1) return s;
	int length = 1;
	int index = 0;
	boolean[][] palindrome = new boolean[s.length()][s.length()];
	for (int i = 0; i < s.length(); i++) {
	palindrome[i][i] = true;
	}

	for (int L = 2; L <= s.length(); L++) {
	for (int i = 0; i < s.length(); i++) {
	int j = i + L - 1;
	if (j >= s.length()) break;

	if (s.charAt(i) != s.charAt(j)) {
	palindrome[i][j] = false;
	} else {
	if (j - i < 3) {
	palindrome[i][j] = true;
	} else {
	palindrome[i][j] = palindrome[i + 1][j - 1];
	}
	}
	if (palindrome[i][j] && j - i + 1 > length) {
	length = j - i + 1;
	index = i;
	}
	}
		}
	map.put(nums[i], i);
	return s.substring(index, index + length);
		}
	return res;
		}
		```

Expand Down