zigzag
2007-11-06 20:56
337 查看
const int dimension = 7;
void make_zigzag(int n, int a[][dimension])
...{
int i = 0, j= 0;
int num = 0;
while (1)
...{
while (i>= 0 && j<= n-1)
...{
a[i--][j++] = num++;
}
if (i<0 && j< n)
...{
i=0;
}
if (j == n)
...{
j = n-1;
i += 2;
}
while ( j >= 0 && i<= n-1)
...{
a[i++][j--] = num++;
}
if ( j < 0 && i< n)
...{
j= 0;
}
if (i == n)
...{
i = n-1;
j += 2;
}
if ( i == n-1 && j == n-1 )
...{
a[i][j] = num;
break;
}
}
}
相关文章推荐
- LeetCode(6) ZigZag Conversion
- 6. ZigZag Conversion
- LeetCode之ZigZag Conversion
- LeetCode 6 ZigZag
- leetcode Binary Tree Zigzag Level Order Traversal
- [Lintcode]Binary Tree Zigzag Level Order Traversal
- Leetcode_06_ZigZag Conversion (easy)
- 【Leetcode】之ZigZag Conversion
- [LeetCode]Binary Tree Zigzag Level Order Traversal
- Leetcode 第6题 ZIGZAG后,行列输出
- LeetCode 6 : ZigZag Conversion (Java)
- LeetCode-6-ZigZag Conversion(找规律)-Easy
- LeetCode 103:Binary Tree Zigzag Level Order Traversal
- Zigzag数组 -- 面试宝典
- [leetcode] 6. ZigZag Conversion
- Binary Tree Zigzag Level Order Traversal -- LeetCode
- 103. Binary Tree Zigzag Level Order Traversal
- [LeetCode] Zigzag Iterator 之字形迭代器
- [leetcode281]Zigzag Iterator
- [LeetCode]题解(python):103-Binary Tree Zigzag Level Order Traversal