Chinaunix首页 | 论坛 | 博客
  • 博客访问: 269917
  • 博文数量: 170
  • 博客积分: 0
  • 博客等级: 民兵
  • 技术积分: 1709
  • 用 户 组: 普通用户
  • 注册时间: 2014-05-06 18:01
文章分类

全部博文(170)

文章存档

2016年(11)

2015年(130)

2014年(29)

发布时间:2015-08-05 21:36:42

//Same Tree Total Accepted: 71830 Total Submissions: 173103 My Submissions Question Solution&nbsp;<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.........【阅读全文】

阅读(380) | 评论(0) | 转发(0)

发布时间: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 />.........【阅读全文】

阅读(375) | 评论(0) | 转发(0)

发布时间:2015-08-05 19:20:48

//Plus One Total Accepted: 56368 Total Submissions: 186154 My Submissions Question Solution&nbsp;<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 .........【阅读全文】

阅读(292) | 评论(0) | 转发(0)

发布时间:2015-08-05 10:04:11

//Minimum Path Sum Total Accepted: 44225 Total Submissions: 136918 My Submissions Question Solution&nbsp;<br />//Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.<br />//<br />//Note: You can only .........【阅读全文】

阅读(257) | 评论(0) | 转发(0)

发布时间:2015-08-04 20:52:48

//Implement regular expression matching with support for '.' and '*'.
//
//'.' Matches any single character.
//'*' Matches zero or more of the preceding element.
//
//The matching should cover the entire input string (not partial).
//
//The function prototyp.........【阅读全文】

阅读(304) | 评论(0) | 转发(0)
给主人留下些什么吧!~~
留言热议
请登录后留言。

登录 注册