摘要： 数位dp https://leetcode.cn/problems/reverse-bits-lcci/description/ public int reverseBits(int num) { int max = 0; int dp1 = 0; int dp2 = 0; for (int i = 阅读全文