- 博客(2)
- 收藏
- 关注
原创 利用递归判断回文(Java)
public class HuiWen{ public static void main(String[] args) { char[] strs = {'2','4','d','4','2'}; boolean huiwen = isHuiwen(strs, 0, strs.length -1,strs.length); System.out.println(huiwen); }
2017-03-24 15:31:10 3311
原创 LeetCode : 求二叉树的最短路径
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.意思就是求一个二叉树的最短路径( ̄▽ ̄)"/** * Defini
2017-03-21 00:15:26 3612
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人