Name		Name	Last commit message	Last commit date
Latest commit History 811 Commits
814.java/* We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not containing a 1 has been removed. (Recall that the subtree of a node X is X, plus every node that is a descendant of X.) Example 1: Input: [1,null,0,0,1] Output: [1,null,0,null,1] /* * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } *		814.java/* We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1. Return the same tree where every subtree (of the given tree) not containing a 1 has been removed. (Recall that the subtree of a node X is X, plus every node that is a descendant of X.) Example 1: Input: [1,null,0,0,1] Output: [1,null,0,null,1] /* * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } *
1.cpp		1.cpp
100.cpp		100.cpp
1002.java		1002.java
101.cpp		101.cpp
1011.java		1011.java
1014.java		1014.java
1019.java		1019.java
102.cpp		102.cpp
1020.java		1020.java
103.cpp		103.cpp
1031.java		1031.java
104.cpp		104.cpp
1048.java		1048.java
105.cpp		105.cpp
1051.java		1051.java
1052.java		1052.java
1054.java		1054.java
1057.java		1057.java
106.cpp		106.cpp
1060.java		1060.java
1066.java		1066.java
107.cpp		107.cpp
1072.java		1072.java
108.cpp		108.cpp
1087.java		1087.java
109.c		109.c
1090.java		1090.java
1099.java		1099.java
110.cpp		110.cpp
111.cpp		111.cpp
112.cpp		112.cpp
113.cpp		113.cpp
1136.java		1136.java
114.cpp		114.cpp
115.cpp		115.cpp
116.cpp		116.cpp
1165.java		1165.java
1167.java		1167.java
1168.java		1168.java
118.cpp		118.cpp
119.cpp		119.cpp
12.cpp		12.cpp
120.cpp		120.cpp
121.cpp		121.cpp
122.cpp		122.cpp
123.cpp		123.cpp
124.java		124.java
125.c		125.c
127.cpp		127.cpp
128.cpp		128.cpp
129.cpp		129.cpp
13.c		13.c
13.cpp		13.cpp
130.cpp		130.cpp
131.cpp		131.cpp
132.cpp		132.cpp
133.cpp		133.cpp
134.c		134.c
136.c		136.c
137.cpp		137.cpp
138.cpp		138.cpp
138.java		138.java
139.cpp		139.cpp
14.cpp		14.cpp
141.c		141.c
142.c		142.c
143.c		143.c
144.cpp		144.cpp
145.cpp		145.cpp
146.cpp		146.cpp
147.cpp		147.cpp
148.cpp		148.cpp
15.cpp		15.cpp
150.cpp		150.cpp
151.cpp		151.cpp
152.cpp		152.cpp
153.java		153.java
154.cpp		154.cpp
154.java		154.java
155.cpp		155.cpp
157.cpp		157.cpp
158.cpp		158.cpp
159.cpp		159.cpp
160.cpp		160.cpp
161.cpp		161.cpp
162.java		162.java
163.cpp		163.cpp
164.cpp		164.cpp
165.c		165.c
166.cpp		166.cpp
167.cpp		167.cpp
168.cpp		168.cpp
169.cpp		169.cpp
17.cpp		17.cpp
170.cpp		170.cpp
171.cpp		171.cpp
172.c		172.c
173.cpp		173.cpp
179.cpp		179.cpp

Repository files navigation

LeetCode

C++11 solutions for problems in Leetcode.

wxping715/LeetCode

Folders and files

Latest commit

History