# Search:

Type: Posts; User: Extremist252

1. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

Okay Thanks anyway for your help!
2. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

I'm afraid not,i don't have a main method to do so and i won't be able to make it because i'm 15 mins away from handing the project over :S

--- Update ---

i commented on what i'm doing beside...
3. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

this is another code i came up with but the output is always -1
public int getWinner() {
boolean flagWhite=false;//checks if the white pieces are connected
boolean flagBlack=false;//checks if the...
4. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

it always point to the recursive call (connected(up)) and all the other points..
what do u think about the iterative implementation? forget about the recursive one
5. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

public int connected(Point test){
ArrayList<Point> connection=new ArrayList<Point>();/ used to check if i visited these points before or not
Point upLeft=new Point(test.getX()-1,test.getY()-1);...
6. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Re: Fast Help please

public int connected(Point test){
ArrayList<Point> connection=new ArrayList<Point>();
Point upLeft=new Point(test.getX()-1,test.getY()-1);
Point up=new Point(test.getX(),test.getY()-1);
Point...
7. ## Thread: Fast Help please

by Extremist252
Replies
12
Views
339

### Fast Help please

Hey guys,

My projects's deadline is 1 hour away and i need to know what are the base cases that i should do while searching in a 2 array for connected pieces so i basically use a DFS but i don't...
Results 1 to 7 of 7