zoukankan      html  css  js  c++  java
  • Path Sum II

     1 public class Solution {
     2     public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
     3         // IMPORTANT: Please reset any member data you declared, as
     4         // the same Solution instance will be reused for each test case.
     5         ArrayList<Integer> list = new ArrayList<Integer>();
     6         ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
     7         if(root == null)
     8             return result;
     9         traversal(root, sum, list, result);
    10         return result;
    11     }
    12     
    13     private void traversal(TreeNode root, int sum, ArrayList<Integer> list, ArrayList<ArrayList<Integer>> result)
    14     {
    15         list.add(root.val);
    16         if(root.left == null && root.right == null){
    17             if(sum == root.val){
    18                 ArrayList<Integer> tmp = new ArrayList<Integer>();
    19                 tmp.addAll(list);
    20                 result.add(tmp);
    21             }
    22         }
    23             
    24         if(root.left != null)
    25             traversal(root.left, sum - root.val, list, result);
    26         if(root.right != null)
    27             traversal(root.right, sum - root.val, list, result);
    28         list.remove(list.size() - 1);
    29     }
    30 }
  • 相关阅读:
    svn不提交.net项目中的bin
    java 与C# 时间格式 交互
    生成菜单序列号
    ashx 方法模板
    webservice使用方法
    如何配置IIS服务器?
    zepto.fullpage
    模拟单选框
    star score
    Hover show tips
  • 原文地址:https://www.cnblogs.com/jasonC/p/3418064.html
Copyright © 2011-2022 走看看