DailyProblem/kthElementInspiralMatrix.cpp at main · Inferno-coder/DailyProblem · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
int top=0;
 	   int bottom=n-1;
 	   int left=0;
 	   int right=m-1;
 	     int cnt=0;
 	   while(top<=bottom && left<=right)
 	   {

 	       for(int i=left;i<=right;i++)
 	       {
 	           cnt++;
 	           if(cnt==k)
 	           {
 	                return a[top][i];
 	           }
 	       }
 	       top++;

 	       for(int i=top ;i<=bottom ;i++)
 	       {
 	           cnt++;
 	           if(cnt==k)
 	           {
 	               return a[i][right];
 	           }

 	       }
 	         right--;


 	       if(top<=bottom){
 	       for(int i=right;i>=left;i--)
 	       {
 	           cnt++;
 	           if(cnt==k)
 	           {
 	               return a[bottom][i];
 	           }
 	       }
 	       bottom--;
 	       }

 	       if(left<=right){
 	       for(int i=bottom;i>=top;i--)
 	       {
 	           cnt++;
 	           if(cnt==k)
 	           {
 	               return a[i][left];
 	           }
 	       }
 	       left++;
 	       }
 	   }
 		return 0;