码迷,mamicode.com
首页 >  
搜索关键字:right    ( 9126个结果
POJ 1838 Banana (并查集)
Description Consider a tropical forrest, represented as a matrix. The cell from the right top corner of the matrix has the coordinates (1,1), and the coordinates of the other cells are determinated...
分类:其他好文   时间:2014-09-05 01:01:10    阅读次数:282
LeetCode--Balanced Binary Tree
递归 1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode...
分类:其他好文   时间:2014-09-04 22:16:00    阅读次数:228
uva 1330 City Game (最大子矩阵)
空白最多的最大子矩阵: #include #include #include using namespace std; const int maxn = 1005; int mat[maxn][maxn],up[maxn][maxn],left[maxn][maxn],right[maxn][maxn]; int main() { int t; scanf("%d",&t); ...
分类:其他好文   时间:2014-09-04 17:02:59    阅读次数:209
leetcode - Rotate List
Given a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NULL.这个题目主...
分类:其他好文   时间:2014-09-04 13:14:29    阅读次数:139
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!