摘要: Problem You are given an N x N matrix with 0 and 1 values. You can swap any two adjacent rows of the matrix. Your goal is to have all the 1 values in 阅读全文
posted @ 2016-03-26 16:25 Vmetrio 阅读(458) 评论(0) 推荐(0)