The WeakReference class, monitoring memory leak and garbage collection in a Java application

-
Image
 Below is a Stack implementation that uses an internal resizeable array structure.  public class MyStack< T > implements Stack< T > { private static final int CAPACITY = 100 ; private Object[] array ; private int pos = 0 ; public MyStack () { this . array = new Object[ CAPACITY ] ; } @Override public void push ( T item) { if ( pos >= array . length / 2 ) { Object[] newArray = new Object[ pos * 2 ] ; System. arraycopy ( array , 0 , newArray , 0 , array . length ) ; array = newArray ; } array [ pos ++] = item ; } @Override public T pop () { if (isEmpty()) { throw new RuntimeException( "empty stack" ) ; } @SuppressWarnings ( "unchecked" ) T item = ( T ) array [ pos - 1 ] ; pos -= 1 ; return item ; } @Override @SuppressWarnings ( "unchecked" ) public T peek...
Post a Comment

More fun with left shift operator

-
Lets say we want to have sum of two integers. But we are not allowed to use + and - operators. Below is a way to do that:

 public class Solution {

    public static int getSum(int a, int b) {

        if (a > 0 && b > 0) {
            return positiveSum(a, b);
        }

        if (a < 0 && b < 0) {
            return negate(positiveSum(Math.abs(a), Math.abs(b)));
        }

        if (a > 0 && b < 0) {
            return minus(a, Math.abs(b));
        } else {
            return minus(b, Math.abs(a));
        }
    }

    private static int minus(int a, int b) {
        boolean[] result = new boolean[32];

        boolean carry = false;

        for (int i = 0; i < 32; ++i) {

            boolean ba = ((a & (1 << i))) != 0;
            boolean bb = (b & (1 << i)) != 0;

            result[i] = ba ^ bb;

            if (carry) {
                result[i] = !result[i];
            }

            if (ba == true) {
                carry = false;
            }

            if (ba == false && bb == true) {
                carry = true;
            }

        }

        int intResult = getIntResult(result);

        return intResult;


    }

    private static int positiveSum(int a, int b) {
        boolean[] result = new boolean[32];

        boolean carry = false;

        for (int i = 0; i < 32; ++i) {

            boolean ba = ((a & (1 << i))) != 0;
            boolean bb = (b & (1 << i)) != 0;

            result[i] = ba ^ bb ^ carry;

            if (carry == true) {
                if (result[i] == true) {
                    carry = false;
                }
            }

            if ((a & (1 << i)) != 0) {
                if ((b & (1 << i)) != 0) {
                    carry = true;
                }
            }
        }

        int intResult = getIntResult(result);

        return intResult;
    }

    private static int getIntResult(boolean[] result) {
        int intResult = 0;
        for (int i = 0; i < result.length; ++i) {

            if (result[i] == true)
                intResult |= (1 << i);

        }
        return intResult;
    }
    // negate a positive value
    private static int negate(int value) {
        if (value < 0) {
            throw new RuntimeException();
        }

        return minus(0, value);
    }
 
    public static void main(String[] args) {

        System.out.println(getSum(-17, -10));
        System.out.println(getSum(17, -10));
        System.out.println(getSum(-10, 17));
        System.out.println(getSum(-15, 32));
        System.out.println(getSum(15, 32));
    }
}

Comments

Post a Comment

Popular posts from this blog

My Crappy Looking Solution to "Binary Tree Common Ancestor" Problem

-
I was able to solve this problem and make all the tests pass: https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor/problem But I'm not happy with the code, so later I need to refactor the code. Here it is: static Node lca(Node root, int v1, int v2) { ArrayList result = new ArrayList<>(); Node result2 = traverse (root, v1, v2, result); if (result.isEmpty()) return result2; return result.get( 0 ); } private static Node traverse(Node root, int v1, int v2, ArrayList result) { if (!result.isEmpty()) { return result.get( 0 ); } if (root. left == null && root. right == null ) { return root; } if (root. data == v1 || root. data == v2) { return root; } Node node1 = null , node2 = null ; if (root. left != null ) node1 = traverse (root. left , v1, v2, result); if (root. right != null ) node2 = traverse (root. right , v1, v...
Read more

Trie Data Structure and Finding Patterns in a Collection of Words

-
Image
 I faced a very hard problem recently about finding substrings based on a collection of patterns.  Example For  words = ["Apple", "Melon", "Orange", "Watermelon"]  and  parts = ["a", "mel", "lon", "el", "An"] , the output should be  findSubstrings(words, parts) = ["Apple", "Me[lon]", "Or[a]nge", "Water[mel]on"] . While  "Watermelon"  contains three substrings from the  parts  array,  "a" ,  "mel" , and  "lon" ,  "mel"  is the longest substring that appears first in the string. Note: Number of words and number of parts can be huge! A brute force method or careless usage of Java String methods would make it impossible to handle a large number of words and parts (patterns). Solution Approach Whenever we want to search patterns inside a string, we should think about the Trie data structure:  https://en.wikipedia....
Read more

A Graph Application in Java: Using WordNet to Find Outcast Words

-
Image
I'll explain our intent with an example: Let's say we have the following words: horse, zebra, cat, bear, table Which one is the outcast? The table.. But how can a computer system find this? We are talking about the whole English language and any word can be in this list. The number of words in the list can be huge, so the solution should use appropriate data structures and algorithms.  We'll use WordNet which is a graph of English words. It contains the semantic relationships between words and our concern is the "is a" relationship. For our example, we know that horse and cat are both animals. "Table" is not an animal and it is the outcast in this situation. But we even have the ability to tell that horse and zebra is very close. Below is a unit test that shows a high level view of our application in Java: public class OutcastTest {     private WordNet wordNet;     private Outcast outcast;     @Before ...
Read more