yarbrough

动态规划https://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns#Minimum-(Maximum)-Path-to-Reach-a-Target

https://blog.youkuaiyun.com/lucky52529/article/details/90172264

位图可以存储大数据存数据的时候，为了节约空间可以采用位图来存假如要存30000这个数public class Main {public static void main(String[] args) {int[] arr = new int[1000];//可以存32000个数//通过将对应的bit位置1的方式存int num = 30000;int intIndex = num...