摘要: 2.设计数组越界错误,n越大,越可能越界 3.设n=1 4. 节点覆盖 [0,1,2,3,4,5,3,4,6,7,8,1,9,10,11,10,12] 边覆盖 [0,1,2,3,4,6,7,8,1,9,10,11,10,12] [0,1,2,3,4,5,3,7,1,9,10,12] 主路径覆盖 [0 阅读全文
posted @ 2016-03-30 17:54 天堂的召唤 阅读(175) 评论(0) 推荐(0)