java - Find available "number" in a 2d array -

-

i have problem need solve in effecient way. have 2d array contains following: 1 "wall" means cannot go through it. 2 entrance "enter" array or map if like. 3 things need find. here example of map:

1111111 1  3131 2 11111 1    31 1111111

this example of array need in. can see there 3 "unreachable, since it's surrounded wall "1". means there 2 available numbers in array.

first need find entrance. since entrance can anywhere need search entire array. have done following:

int treasureamount = 0;      point entrance = new point(0,0);      (int = 0; < n; i++) {          (int j = 0; j < n; i++){              if(map[i][j] == 2){                  entrance.x =i;                  entrance.y =j;              }           }

this takes o(n^2) time, , don't see way this, since entrance can anywhere. i'm not sure how find available numbers effectivly , fast. thought while searching arrays entrance @ same time find number 3 in array though might not accessible, , after i'm not sure how effectivly find accessible.

you cannot better o(n^2). take time read array. depth first search find reachable 3's in array. here pseudo code.

main() {     read array , mark entrance ent.x , ent.y , array threex[] , threey[] stores exit position.     boolean visited[][]; //stores whether array[i][j] reachable or not.     dfs(ent.x,ent.y);     each element in 3 arrays     {         if(visited[threex[i]][threey[i]]) print ("reachable");         else print("not reachable", threex[i], threey[i]);     } } int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; // dx[i], dy[i] tells whether move in e,n,w,s respectively. dfs(int x,int y) {     visited[x][y]=true;     for(i=0;i<4;i++)//move in directions     {         int newx=x+dx[i],newy=y+dy[i];         //check if within array boundary         if(newx>=0&&newx<n && newy>=0&&newy<n)         if(!visited[newx][newy] && array[newx][newy]!=1) // check if node unvisited , pemissible              dfs(newx,newy);     } }

since each array element taken not more once in dfs function complexity of code o(n^2).


Popular posts from this blog

How to calculate SNR of signals in MATLAB? -

-
i've encountered simple, yet fundamental problem on calculating snr: there several signals : s1 = original , pure clean signal without noise. n1 = white gaussian noise going added s1. s2 = s1 + n1 (the noisy signal before performing noise-reduction algorithm) s3 = noise-reduced signal (after performing noise reduction algorithm) n2 = s3 - s1 (the amount of noise after performing noise-reduction algorithm) now want compare snr before , after performing noise-reduction algorithm. which signals should consider snr_before!? s1/n1 or s2/n1 ? which signals should consider snr_after!? s3/n1 or s3/n2 ? which commands or functions should use in matlab in order compute snr_before , snr_after? thanks billion putting time on helping me. what know calculating snr before : snrbeforenoise = mean( signal .^ 2 ) / mean( noise .^ 2 ); and snr after : residual_noise = signal - noise_reduced_signal; snr_after = mean( signal .^ 2 ) / mean( residual_noise .^ 2
Read more

c# - Attempting to upload to FTP: System.Net.WebException: System error -

-
i have api takes in xml , uploads files based on information in xml. uploads on schedule (also xml), , have tested surrounding , know works. i getting error 40% of time on first file attempt upload in each time cycle (time cycle = 45 minutes files, 30 minutes others). here code upload: try { loggerftp.log("uploading file: " + filename, false); // create request. ftpwebrequest request = (ftpwebrequest)webrequest.create(appsettingsftp.ftpurl + @"/" + filename); request.method = webrequestmethods.ftp.uploadfile; request.timeout = 6000000; //set 100 minutes //request.timeout = -1; //set infinite // add login credentials. request.credentials = new networkcredential(appsettingsftp.ftplogin, appsettingsftp.ftppassword); // grab file contents. streamreader sourcestream = new streamreader(appsettingsftp.uploadfiledirectory + filename); byte[] filecontents = encoding.utf8.getbytes(sourcestream.readtoend()); sourcest
Read more

ios - UISlider customization: how to properly add shadow to custom knob image -

-
Image
i need place custom knob image shadow uislider. far have image of 38x38, of there region defines shadow of knob. now while using image, when slide knob extreme ends actual knob not able cover end points, hence end points visible under transparent region of knob image this code using customize uislider uiimage *slidebtimg = [uiimage imagenamed:sliderknobimg]; [self.ratingslider setthumbimage:slidebtimg forstate:uicontrolstatenormal]; [self.ratingslider setthumbimage:slidebtimg forstate:uicontrolstatehighlighted]; how can implement custom knob shadow beneath it, covering end points?? look inside uislider.h , there methods let customize slider knob , track needed. (ios 2.0 , above) // lets subclass lay out track , thumb needed - (cgrect)minimumvalueimagerectforbounds:(cgrect)bounds; - (cgrect)maximumvalueimagerectforbounds:(cgrect)bounds; - (cgrect)trackrectforbounds:(cgrect)bounds; - (cgrect)thumbrectforbounds:(cgrect)bounds trackrect:(cgrect)rect value:
Read more