Update Readme.md

wisdompeak · web-flow · commit 65565ad07b05 · 2022-02-17T20:39:24.000-08:00
diff --git a/Dynamic_Programming/1595.Minimum-Cost-to-Connect-Two-Groups-of-Points/Readme.md b/Dynamic_Programming/1595.Minimum-Cost-to-Connect-Two-Groups-of-Points/Readme.md
@@ -19,7 +19,6 @@ for (int i=0; i<m; i++)
   {
     for (int subset : state)
       dp[i][state] = dp[i-1][state-subset] + cost[i][subset]
-    dp[i][state[ = dp[i-1][state] + minCost[i]
   }
 ```
 &#27880;&#24847;&#23545;&#20110;state&#30340;&#36941;&#21382;&#23884;&#22871;subset&#30340;&#36941;&#21382;&#65292;&#26102;&#38388;&#22797;&#26434;&#24230;&#24182;&#19981;&#26159;``` 2^N * 2^N```&#65292;&#32780;&#26159;```3^N```&#12290;&#20320;&#21487;&#20197;&#24819;&#35937;&#65292;&#23545;&#20110;&#27599;&#19968;&#20010;bit&#65292;&#22312;&#22806;&#12289;&#37324;&#20004;&#23618;&#30340;&#29366;&#24577;&#21482;&#21487;&#33021;&#26159;```10,11,00```&#12290;

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,6 @@ for (int i=0; i<m; i++)`
`19`	`19`	`{`
`20`	`20`	`for (int subset : state)`
`21`	`21`	`dp[i][state] = dp[i-1][state-subset] + cost[i][subset]`
`22`		`- dp[i][state[ = dp[i-1][state] + minCost[i]`
`23`	`22`	`}`
`24`	`23`	```
`25`	`24`	注意对于state的遍历嵌套subset的遍历，时间复杂度并不是``` 2^N * 2^N```，而是```3^N```。你可以想象，对于每一个bit，在外、里两层的状态只可能是```10,11,00```。