摘要:
1 public class Solution { 2 public List> partition(String s) { 3 int len=s.length(); 4 boolean dp[][]=new boolean[len][len]; 5... 阅读全文
摘要:
public class Solution { public void merge(int A[], int m, int B[], int n) { int a=m-1; int b=n-1; int index=m+n-1; whil... 阅读全文
摘要:
使用最简单的排序方法; 1 /** 2 * Definition for an interval. 3 * public class Interval { 4 * int start; 5 * int end; 6 * Interval() { start = 0;... 阅读全文
摘要:
https://oj.leetcode.com/problems/valid-parentheses/遇到左括号入栈,遇到右括号出栈找匹配,为空或不匹配为空,public class Solution { public boolean isValid(String s) { ch... 阅读全文