摘要:
17. Letter Combinations of a Phone Number Medium Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the 阅读全文
摘要:
public List generateParenthesis(int n) { ArrayList result = new ArrayList(); dfs(result, "", n, n); return result; } /* left and right represents the remaining number of ( and ) that need... 阅读全文
摘要:
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the s 阅读全文
摘要:
package com.problem01; import java.util.HashMap; public class Main { public static void main(String[] args) { String s = "abcddbcaa"; System.out.println(longestPalindrome(s)); } public ... 阅读全文