- 博客(5)
- 收藏
- 关注
RSS订阅原创 Add Digits
public class Solution { public int addDigits(int num) { return num%9 == 0 ? (num==0?0:9) : num%9; }}Hints: A naive implementation of the above process is trivial. Could you
2015-08-16 20:52:07
154
原创 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
147
原创 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
154
原创 DFS中如何一找到true就返回true， 其他返回false
boolean function(object, currentLocation, Termination){ if (currentLocation satisfies Terminaiton){ return true; } for (go through all the nextLocations){ if (u
2013-11-22 11:41:33
575
原创 如何在所有情况中挑选
function(object[], object, currentLocation, Termination){ if (currentLocation satisfies Terminaiton){ object[].add(object); return; } for (go through all the conditio
2013-11-22 11:30:13
336
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人