nickwph

Idea

# stack: a stack that store the current combination
# items: available items, each item has a value
# available_space: the spaces left of the current combination
# index: the index of items it is going to match
function find_combinations_recursively(stack, items, available_space, index):
    # check for invalid target or value
    value = items[index]

nickwph

Define Node

static class Node {
    int value;
    Node left, right;
}

Depth First Recursive Traversal (Pre-order)

nickwph

#!/bin/sh
# run this to install
#   sudo su install-sublime-text-3.sh

# modify this if you need another version or or architecture
URL="http://c758482.r82.cf2.rackcdn.com/sublime_text_3_build_3083_x64.tar.bz2"

SHORTCUT="[Desktop Entry]
Name=Sublime Text 3
Comment=Edit text files

nickwph

# node structure
class Node:
    value = None
    left = None
    right = None
 
    # constructor
    def __init__(self, value, left=None, right=None):
        self.value = value
        self.left = left

nickwph

import java.util.Scanner;

public class Solution1 {
    public static void main(String[] args) {
        try {
            // read in matrix
            Scanner scanner = new Scanner(System.in);
            int length = Integer.parseInt(scanner.nextLine());
            int[][] matrix = new int[length][length];
            for (int i = 0; i < length; i++) {

nickwph

/**
 * Created by Nicholas Wong <nickwph@yahoo-inc.com>.
 * Gradle build file to set up variables for JaCoCo.
 * The following tasks will be created in normal circumstance.
 *
 * - Create JaCoCo HTML and XML Reports
 *     jacocoDebug
 *     jacocoRelease
 *
 * - Open JaCoCo HTML Report in Mac OSX