Grind75

#57. Insert Interval (link)

class Solution {

public int[][] insert(int[][] intervals, int[] newInterval) {

int start = newInterval[0], stop = newInterval[1];

// case: newInterval contains all intervals

if (intervals.length == 0 || start <= intervals[0][0] && stop >= intervals[intervals.length-1][1]) {

int[][] result = new int[1][2];

result[0] = newInterval;

return result;

}

int[] insertion = new int[2];

// What should insertion[0] be?

insertion[0] = start;

if (start > intervals[0][0]) {

for (int i=0; i<intervals.length; i++) {

if (start >= intervals[i][0] && start <= intervals[i][1]) {

insertion[0] = intervals[i][0];

break;

}

}

}

// What should insertion[1] be?

insertion[1] = stop;

if (stop < intervals[intervals.length-1][1]) {

for (int i=0; i<intervals.length; i++) {

if (stop >= intervals[i][0] && stop <= intervals[i][1]) {

insertion[1] = intervals[i][1];

break;

}

}

}

// Place insertion

boolean added = false;

List<Integer[]> result = new ArrayList<>();

for (int i=0; i<intervals.length; i++) {

if (insertion[0] <= intervals[i][0]) {

addToList(insertion, result);

added = true;

while (i<intervals.length && intervals[i][1] <= insertion[1]) {

i++;

}

copyRest(i, intervals, result);

break;

} else {

addToList(intervals[i], result);

}

}

if (!added) {

// add at the end

addToList(insertion, result);

}

// List to arrays

int[][] array = new int[result.size()][2];

for (int i=0; i<result.size(); i++) {

array[i][0] = result.get(i)[0];

array[i][1] = result.get(i)[1];

}

return array;

}

private void copyRest(int from, int[][] intervals, List<Integer[]> list) {

for (int i=from; i<intervals.length; i++) {

addToList(intervals[i], list);

}

}

private void addToList(int[] interval, List<Integer[]> list) {

Integer[] pair = new Integer[2];

pair[0] = interval[0];

pair[1] = interval[1];

list.add(pair);

}

}

Pt. restul LINK

Exemple Deadlock & Livelock

Deadlock

Cand doua sau mai multe fire de executie sunt blocate in asteptarea eliberarii unor resurse de care au nevoie. Solutie: how to prevent deadlock in Java.

private static void deadlock() {
    final String res1 = "Resource_1";
    final String res2 = "Resource_2";

    Thread t1 = new Thread(() -> {
        synchronized (res1) {
            System.out.println("[t1] acquired access to res1");
            try {
                Thread.sleep(5000);
            } catch (InterruptedException e) {
                throw new RuntimeException(e);
            }
            synchronized (res2) {
                System.out.println("[t1] Yay! escaped deadlock."); // not happening
            }
        }
    });
    Thread t2 = new Thread(() -> {
        synchronized (res2) {
            System.out.println("[t2] acquired access to res2");
            try {
                Thread.sleep(5000);
            } catch (InterruptedException e) {
                throw new RuntimeException(e);
            }
            synchronized (res1) {
                System.out.println("[t2] Yay! escaped deadlock.");
            }
        }
    });

    t1.start();
    t2.start();
}

Livelock

Doua sau mai multe fire de executie isi cedeaza dreptul de a rula in favoarea celorlalte astfel ajungand sa nu ruleze niciodata, iar aplicatia nu progreseaza. Solutie: schimbarea logicii.

static class Spoon {
    Diner owner;

    public Spoon (Diner firstOwner) {
        this.owner = firstOwner;
    }

    synchronized void setOwner(Diner owner) {
        this.owner = owner;
    }

    synchronized void use() {
        System.out.println(owner.name + " just ate!");
    }
}

static class Diner {
    String name;
    boolean isHungry;

    public Diner (String name) {
        this.name = name;
        this.isHungry = true;
    }

    public void eatWith (Spoon spoon, Diner spouse) {
        while (isHungry) {
            if (spoon.owner != this) {
                // wait for a while for the spoon to be released
                try {
                    Thread.sleep(3000);
                } catch (InterruptedException e) {
                    throw new RuntimeException(e);
                }
            }

            // after wait, try to give the spoon to the spouse if she's hungry
            if (spouse.isHungry) {
                System.out.println("[" + name + "] Eat, baby, eat!");
                spoon.owner = spouse;
            } else {
                // finally
                spoon.use();
                isHungry = false;
                System.out.println("[" + name + "] Finally ate!!!"); // never
                spoon.owner = spouse;
            }
        }
    }
}

private static void livelock() {
    final Diner husband = new Diner("Adnan");
    final Diner wife = new Diner("Hannan");
    Spoon spoon = new Spoon(wife);
    
    try {
        new Thread(() -> husband.eatWith(spoon, wife)).start();
        Thread.sleep(1500);
        new Thread(() -> wife.eatWith(spoon, husband)).start();
    } catch (InterruptedException e) {
        throw new RuntimeException(e);
    }
}

Script bash pt build proiecte

 ./script.sh <nume branch>

branch="master"

if [ -n "$1" ]; then

branch=$1

fi

printf "\ngit pull from "$branch"\n\n"

currentDate=`date +"%Y-%m-%d-%H%M"`

filename="$currentDate.log"

touch $filename

for dir in `ls .`;

do

if [[ -d $dir ]]; then

echo $'\n'$dir

cd $dir

mvn clean &>> ../$filename

git checkout master

git pull

cd ..

echo $'\n' &>> $filename

fi

done

# legacy first

echo $'\n' >> $filename

for dir in `ls .`;

do

if [[ -d $dir && "$dir" == *"legacy"* ]]; then

echo $'\n'$dir

cd $dir

mvn install -DskipTests &>> ../$filename

cd ..

echo $'\n' &>> $filename

fi

done

printf "\n"

for dir in `ls .`;

do

if [[ -d $dir && "$dir" != *"legacy"* ]]; then

echo $'\n'$dir

cd $dir

mvn install -DskipTests &>> ../$filename

cd ..

echo $'\n' &>> $filename

fi

done