maydayco

public class Solution {
    public String multiply(String num1, String num2) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int adv = 0;
        int[] num = new int[num1.length() + num2.length() ];
        num1 = new StringBuffer(num1).reverse().toString();
        num2 = new StringBuffer(num2).reverse().toString();
        for (int i = 0; i < num1.length(); i++) {
            for (int j = 0; j < num2.length(); j++) {

maydayco

public class Solution {
    public String minWindow(String S, String T) {
        // Start typing your Java solution below
        // DO NOT write main() function                
        int[] num = new int[256];
        int[] hasFound = new int[256];
        for (int i = 0; i < T.length(); i++) {
            num[T.charAt(i)]++;
        }
        int found = 0;

maydayco

public class Solution {
    public String minWindow(String S, String T) {
        // Start typing your Java solution below
        // DO NOT write main() function
        HashMap<Character, LinkedList<Integer>> hash = new HashMap<Character, LinkedList<Integer>>();
        HashSet<Character> set = new HashSet<Character>();
        PriorityQueue<Integer> pq = new PriorityQueue<Integer>();
        int[] num = new int[256];
        for (int i = 0; i < T.length(); i++) {
            num[T.charAt(i)]++;

maydayco

public class Solution {
    public boolean isInterleave(String s1, String s2, String s3) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if (s1.length() + s2.length() != s3.length())
            return false;
        
        
        boolean[][] sol = new boolean[s1.length() + 1][s2.length() + 1];
        sol[0][0] = true;        

maydayco

public class Solution {
    public boolean isMatch(String s, String p) {
        // Start typing your Java solution below
        // DO NOT write main() function
        boolean[][] sol = new boolean[s.length() + 1][p.length() + 1];
        sol[0][0] = true;
        for (int i = 2; i <= p.length(); i++) {
            if (p.charAt(i - 1) == '*') {
                sol[0][i] = sol[0][i - 2];
            }

maydayco

public class Solution {
    public boolean isMatch(String s, String p) {
        // Start typing your Java solution below
        // DO NOT write main() function
        boolean[][] sol = new boolean[2][p.length() + 1];
        sol[0][0] = true;
        int len = 0;
        for (int i = 1; i <= p.length(); i++) {
            if (p.charAt(i - 1) == '*')
                sol[0][i] = sol[0][i - 1];

maydayco

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {

maydayco

/**
 *The IncidentsCalculation calculates the incidents percentage for a given query and all the incidents.
 * 
 * @author Xidong Liu <xliu035@gmail.com>
 */

import java.util.*;

public class IncidentsCalculation {
  

maydayco

/**
 * The IncidentsCalculationExtension calculates the incidents percentage for a given list of queries and all the incidents.
 * 
 * @author Xidong Liu <xliu035@gmail.com>
 */

import java.util.*;

public class IncidentsCalculationExtension {

maydayco

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