摘要:
1. 数字的二进制位对应;可以转化为01数组来做。void getNextPaiLie(vector<bool> &quanPaiLie){ for (int i= quanPaiLie.size()-1;i>=0;i-- ) { if (quanPaiLie[i]) { quanPaiLie[i] = false; } else { quanPaiLie[i] = true; return; } }}bool isOver(v... 阅读全文
posted @ 2013-06-11 11:30
10,000 hours coder
阅读(193)
评论(0)
推荐(0)