Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Solution {
- public int[][] generateMatrix(int n)
- {
- if(n<1)
- return new int[0][0];
- int[][] p=new int[n][n];
- for(int i=0;i<n;i++)
- {
- for(int j=0;j<n;j++)
- {
- if(i<=j)
- {
- if(i+j<n)
- {
- p[i][j]=i*(4*n-4*i)+j-i+1;
- }
- else
- {
- p[i][j]=(n-1-j)*(1+j)*4+2*j+2-n+(i-n+1+j);
- }
- }
- else
- {
- if(i+j<n)
- {
- p[i][j]=(j+1)*4*(n-j-1)+1-(i-j);
- }
- else
- {
- p[i][j]=(n-i)*4*i+1+(n-1-2*i)-(j+1+i-n);
- }
- }
- }
- }
- return p;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement