diff --git "a/problems/0034.345円234円250円346円216円222円345円272円217円346円225円260円347円273円204円344円270円255円346円237円245円346円211円276円345円205円203円347円264円240円347円232円204円347円254円254円344円270円200円344円270円252円345円222円214円346円234円200円345円220円216円344円270円200円344円270円252円344円275円215円347円275円256円.md" "b/problems/0034.345円234円250円346円216円222円345円272円217円346円225円260円347円273円204円344円270円255円346円237円245円346円211円276円345円205円203円347円264円240円347円232円204円347円254円254円344円270円200円344円270円252円345円222円214円346円234円200円345円220円216円344円270円200円344円270円252円344円275円215円347円275円256円.md"
index 7e58a870d8..e5266cd9ea 100644
--- "a/problems/0034.345円234円250円346円216円222円345円272円217円346円225円260円347円273円204円344円270円255円346円237円245円346円211円276円345円205円203円347円264円240円347円232円204円347円254円254円344円270円200円344円270円252円345円222円214円346円234円200円345円220円216円344円270円200円344円270円252円344円275円215円347円275円256円.md"
+++ "b/problems/0034.345円234円250円346円216円222円345円272円217円346円225円260円347円273円204円344円270円255円346円237円245円346円211円276円345円205円203円347円264円240円347円232円204円347円254円254円344円270円200円344円270円252円345円222円214円346円234円200円345円220円216円344円270円200円344円270円252円344円275円215円347円275円256円.md"
@@ -240,7 +240,7 @@ class Solution {
 		while (left - 1>= 0 && nums[left - 1] == nums[index]) { // 防止数组越界。逻辑短路,两个条件顺序不能换
 			left--;
 		}
- // 向左滑动,找右边界
+ // 向右滑动,找右边界
 		while (right + 1 < nums.length && nums[right + 1] == nums[index]) { // 防止数组越界。 right++; } diff --git "a/problems/0047.345円205円250円346円216円222円345円210円227円II.md" "b/problems/0047.345円205円250円346円216円222円345円210円227円II.md" index 53ea62ba5b..6999b732dc 100644 --- "a/problems/0047.345円205円250円346円216円222円345円210円227円II.md" +++ "b/problems/0047.345円205円250円346円216円222円345円210円227円II.md" @@ -98,6 +98,8 @@ public: } }; +// 时间复杂度: 最差情况所有元素都是唯一的。复杂度和全排列1都是 O(n! * n) 对于 n 个元素一共有 n! 中排列方案。而对于每一个答案,我们需要 O(n) 去复制最终放到 result 数组 +// 空间复杂度: O(n) 回溯树的深度取决于我们有多少个元素 ``` * 时间复杂度: O(n) * 空间复杂度: O(n) diff --git "a/problems/0322.351円233円266円351円222円261円345円205円221円346円215円242円.md" "b/problems/0322.351円233円266円351円222円261円345円205円221円346円215円242円.md" index 67b1a6d9cd..1f3f4df27f 100644 --- "a/problems/0322.351円233円266円351円222円261円345円205円221円346円215円242円.md" +++ "b/problems/0322.351円233円266円351円222円261円345円205円221円346円215円242円.md" @@ -355,23 +355,52 @@ func min(a, b int) int { Rust: ```rust -pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
- let amount = amount as usize;
- let mut dp = vec![i32::MAX; amount + 1];
- dp[0] = 0;
- for i in 0..coins.len() {
- for j in coins[i] as usize..=amount {
- if dp[j - coins[i] as usize] != i32::MAX {
- dp[j] = dp[j].min(dp[j - coins[i] as usize] + 1);
+// 遍历物品
+impl Solution {
+ pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
+ let amount = amount as usize;
+ let mut dp = vec![i32::MAX; amount + 1];
+ dp[0] = 0;
+ for coin in coins {
+ for i in coin as usize..=amount {
+ if dp[i - coin as usize] != i32::MAX {
+ dp[i] = dp[i].min(dp[i - coin as usize] + 1);
+ }
 }
 }
+ if dp[amount] == i32::MAX {
+ return -1;
+ }
+ dp[amount]
 }
- if dp[amount] == i32::MAX { -1 } else { dp[amount] }
+}
+```
+
+```rust
+// 遍历背包
+impl Solution {
+ pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
+ let amount = amount as usize;
+ let mut dp = vec![i32::MAX; amount + 1];
+ dp[0] = 0;
+ for i in 1..=amount {
+ for &coin in &coins {
+ if i>= coin as usize && dp[i - coin as usize] != i32::MAX {
+ dp[i] = dp[i].min(dp[i - coin as usize] + 1)
+ }
+ }
+ }
+ if dp[amount] == i32::MAX {
+ return -1;
+ }
+ dp[amount]
+ } 
 }
 ```
 
 Javascript:
 ```javascript
+// 遍历物品
 const coinChange = (coins, amount) => {
 if(!amount) {
 return 0;
@@ -380,7 +409,7 @@ const coinChange = (coins, amount) => {
 let dp = Array(amount + 1).fill(Infinity);
 dp[0] = 0;
 
- for(let i =0; i < coins.length; i++) { + for(let i = 0; i < coins.length; i++) { for(let j = coins[i]; j <= amount; j++) { dp[j] = Math.min(dp[j - coins[i]] + 1, dp[j]); } @@ -390,9 +419,26 @@ const coinChange = (coins, amount) => {
 }
 ```
 
+```javascript
+// 遍历背包
+var coinChange = function(coins, amount) {
+ const dp = Array(amount + 1).fill(Infinity)
+ dp[0] = 0
+ for (let i = 1; i <= amount; i++) { + for (let j = 0; j < coins.length; j++) { + if (i>= coins[j] && dp[i - coins[j]] !== Infinity) {
+ dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1)
+ }
+ }
+ }
+ return dp[amount] === Infinity ? -1 : dp[amount]
+}
+```
+
 TypeScript:
 
 ```typescript
+// 遍历物品
 function coinChange(coins: number[], amount: number): number {
 const dp: number[] = new Array(amount + 1).fill(Infinity);
 dp[0] = 0;
@@ -406,6 +452,23 @@ function coinChange(coins: number[], amount: number): number {
 };
 ```
 
+```typescript
+// 遍历背包
+function coinChange(coins: number[], amount: number): number {
+ const dp: number[] = Array(amount + 1).fill(Infinity)
+ dp[0] = 0
+ for (let i = 1; i <= amount; i++) { + for (let j = 0; j < coins.length; j++) { + if (i>= coins[j] && dp[i - coins[j]] !== Infinity) {
+ dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1)
+ }
+ }
+ }
+ return dp[amount] === Infinity ? -1 : dp[amount]
+}
+```
+
+
 <p>
 <a href="https://programmercarl.com/other/kstar.html">
 
</div><div class="naked_ctrl">
<form action="/index.cgi/contrast" method="get" name="gate">
<p><a href="http://altstyle.alfasado.net">AltStyle</a> によって変換されたページ <a href="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/youngyangyang04-leetcode-master/pull/286.diff">(-&gt;オリジナル)</a>
/ <label>アドレス: <input type="text" name="naked_post_url" value="https://patch-diff.githubusercontent.com/raw/AlgorithmAndLeetCode/youngyangyang04-leetcode-master/pull/286.diff" size="22" /></label> <label>モード: <select name="naked_post_mode">
<option value="default">デフォルト</option>
<option value="speech">音声ブラウザ</option>
<option value="ruby">ルビ付き</option>
<option value="contrast" selected="selected">配色反転</option>
<option value="larger-text">文字拡大</option>
<option value="mobile">モバイル</option>
</select>
<input type="submit" value="表示" />
</p>
</form>
</div>