Skip to content

Adding this again in your hacktoberfest folder #275

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Arijit0918 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Adding this again in your hacktoberfest folder #275

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e0cb7f9
Create Path Sum III.java
Arijit0918 Oct 8, 2022
81481ce
Create Path Sum III.java
Arijit0918 Oct 9, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
48 changes: 48 additions & 0 deletions Binary Tree/Path Sum III.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
import java.util.*;
import java.io.*;

class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}

public class Main{

public static int pathSum(TreeNode root, int targetSum) {
HashMap<Long,Integer> map=new HashMap<Long,Integer>();
map.put((long)0,1);
return paths(root,0,targetSum,map);
}
public static int paths(TreeNode root,long currsum,int target,HashMap<Long,Integer> map){
if(root==null)return 0;

currsum+=root.val;
int res=map.getOrDefault(currsum-target,0);
map.put(currsum,map.getOrDefault(currsum,0)+1);
res+=paths(root.left,currsum,target,map)+paths(root.right,currsum,target,map);
map.put(currsum,map.get(currsum)-1);
return res;
}
public static void main(String args[]){
int target=8;
TreeNode root=new TreeNode(10);
root.left=new TreeNode(5);
root.right=new TreeNode(-3);
root.left.left=new TreeNode(3);
root.left.right=new TreeNode(2);
root.right.right=new TreeNode(11);
root.left.right.right=new TreeNode(1);
root.left.left.left=new TreeNode(3);
root.left.left.right=new TreeNode(-2);
int ans=pathSum(root,target);
System.out.println("Number of paths with sum=8 is "+ans);
}
}
48 changes: 48 additions & 0 deletions Hacktoberfest2022/Path Sum III.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
import java.util.*;
import java.io.*;

class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}

public class Main{

public static int pathSum(TreeNode root, int targetSum) {
HashMap<Long,Integer> map=new HashMap<Long,Integer>();
map.put((long)0,1);
return paths(root,0,targetSum,map);
}
public static int paths(TreeNode root,long currsum,int target,HashMap<Long,Integer> map){
if(root==null)return 0;

currsum+=root.val;
int res=map.getOrDefault(currsum-target,0);
map.put(currsum,map.getOrDefault(currsum,0)+1);
res+=paths(root.left,currsum,target,map)+paths(root.right,currsum,target,map);
map.put(currsum,map.get(currsum)-1);
return res;
}
public static void main(String args[]){
int target=8;
TreeNode root=new TreeNode(10);
root.left=new TreeNode(5);
root.right=new TreeNode(-3);
root.left.left=new TreeNode(3);
root.left.right=new TreeNode(2);
root.right.right=new TreeNode(11);
root.left.right.right=new TreeNode(1);
root.left.left.left=new TreeNode(3);
root.left.left.right=new TreeNode(-2);
int ans=pathSum(root,target);
System.out.println("Number of paths with sum=8 is "+ans);
}
}