- 博客(2)
- 收藏
- 关注
原创 Invert Binary Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solution {
2015-07-09 23:15:52 164
原创 Contains Duplicate
public class Solution { public boolean containsDuplicate(int[] nums) { Set temp = new HashSet(); for (int i=0; i<nums.length; i++){ temp.add(nums[i]); if (t
2015-07-09 22:33:26 170
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人