发布时间：2015-08-08 17:47:38
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
public class NumberFormat {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
ArrayList<String> list = new ArrayList<String>();
int t = In.........【阅读全文】
发布时间：2015-08-06 22:01:30
<br /><br />public class UniquePaths {<br /><br /><br />public static void main(String[] args) {<br />// TODO Auto-generated method stub<br /><br /><br />}<br />public int uniquePaths(int m, int n) {<br />// int[][] pathcount=new int[m][n];<br />//  .........【阅读全文】
发布时间：2015-08-05 21:36:42
//Same Tree Total Accepted: 71830 Total Submissions: 173103 My Submissions Question Solution <br />//Given two binary trees, write a function to check if they are equal or not.<br />//<br />//Two binary trees are considered equal if they are structurally identical and the nodes have the same.........【阅读全文】
发布时间：2015-08-05 21:29:58
//Given two binary strings, return their sum (also a binary string).<br />//<br />//For example,<br />//a = "11"<br />//b = "1"<br />//Return "100".<br />public class AddBinary {<br /><br /><br />public static void main(String[] args) {<br />// TODO Auto-generated method stub<br /><br />.........【阅读全文】
发布时间：2015-08-05 19:20:48
//Plus One Total Accepted: 56368 Total Submissions: 186154 My Submissions Question Solution <br />//Given a non-negative number represented as an array of digits, plus one to the number.<br />//<br />//The digits are stored such that the most significant digit is at the head of the list.<br .........【阅读全文】
