Skip to content

Fixed broken problem #25

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

Merged
merged 1 commit into from
Dec 7, 2018
Merged

Fixed broken problem #25

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
9 changes: 3 additions & 6 deletions LeetcodeProblems/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -61,11 +61,8 @@ var TreeNode = function(val) {
this.left = this.right = null;
}

console.log(
buildTree(
[3,9,20,15,7],
[9,3,15,20,7]
)
);
var main = function() {
console.log(buildTree([3,9,20,15,7], [9,3,15,20,7]));
}

module.exports.main = main
12 changes: 8 additions & 4 deletions Main.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,8 +9,12 @@ var main = async function() {
for(i in problems) {
console.log("Solving: " + problems[i] + ":");
const problem = require(PROBLEMS_FOLDER + problems[i]);
problem.main();
console.log("End of the solution for : " + problems[i] + ",\n\n");
if (typeof(problem.main) !=='undefined') {
problem.main();
console.log("End of the solution for : " + problems[i] + ",\n\n");
} else {
console.warn(problem, "The problem " + problems[i] + " doesn't have a main method implemented.");
}
}
} catch (error) {
throw new Error(error);
Expand All @@ -23,8 +27,8 @@ var loadProblems = () => {
if (error) {
reject(error);
} else {
problems = files.filter(item => !(REGEX_PATTERN_HIDDEN_FILES).test(item));
resolve(problems);
problems = files.filter(item => !(REGEX_PATTERN_HIDDEN_FILES).test(item));
resolve(problems);
}
})
});
Expand Down