i can, if someone will search for the soluthion - here it is.

public class Lamport {
private static int N = 1; // howMenyThreads
private static int[] enter = new int[N];
private static int[] number = new int[N];

public void enterRegion(int i) {

enter[i] = 1;
number[i] = 1 + maximum(number);
enter[i] = 0;
for (int j = 0; j < N; j++) {
while (enter[j] != 0) {
  // wait until thread j receives its number
}
while ((number[j] != 0) &&  ((number[j]<number[i]) ||
(number[j]==number[i] && j<i) )) {
// wait until threads with smaller numbers or with the same
// number, but with higher priority, finish their work
}
}
}

public void leaveRegion(int i) {
number[i] = 0;
}

private int maximum(int[] table) {
int result=table[0];

for (int i=0;i<table.length;i++)    {
if (result<table[i])
result = table[i];
}
return result;
}
}

ppp napisal(a):