you must create a function?powers?that takes an array, and returns the number of subsets possible to create from that list. In other words, counts the power sets.

For instance ?powers([1,2,3]) => 8 ?即求 集合的子集

good example：

public class Powers {

　　public static BigInteger powers(int[] list){

　　return BigInteger.valueOf(2).pow(list.length);

　　}

}

public static BigInteger powers(int[] list) {

return BigInteger.ONE.shiftLeft(list.length);

}

?

轉載于:https://www.cnblogs.com/lgaigai/p/4279355.html

總結

以上是生活随笔為你收集整理的Counting power sets的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。