xynophon

import java.util.Scanner;

/**
 * Created by xynophon on 15.1.27.
 */

public class roman_2_integer{

// I 1
// IV 4

xynophon

import java.util.Arrays;
import java.util.HashMap;

/**
 * Created by xynophon on 15.2.27.
 */
public class majorityElement {
    public int majorityElement(int[] num) {
        //bad solution using Hash. O(n). it took 343ms.
        int half = num.length/2;

xynophon

import java.util.*;

public class SameTree {
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }

xynophon

class StackList {
    Node top;

    void push(Object data){
        Node t = new Node(data);
        t.next = top;
        top = t;
    }

    Object pop(){

xynophon

import java.util.*;

    public static int hammingWeight(int n) {
        int cnt = 0;
        while(n != 0){
            if(0 != n%2){ //if(1 == n%2){
                cnt++;
            }
            n = n >>> 1;
        }

xynophon

import java.util.*;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }

xynophon

import java.util.*;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }

xynophon

import java.util.*;

public class InvertBinaryTree {

    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;

xynophon

import java.util.*;

public class BSTIterator {

    /**
     * Definition for binary tree
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;

xynophon

import java.util.*;

public class Permutations {
    public List<List<Integer>> permute(int[] nums) {
        List<List<Integer>> result = new ArrayList<>();
        List<Integer> l0 = new ArrayList<>();
        l0.add(nums[0]);
        result.add(l0);

        for (int i = 1; i < nums.length; i++) {