algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2164 from enjoy-binbin/fix_typo

Browse Source 
错别字修复：recode -> record
This commit is contained in:
程序员Carl
2023-07-21 09:41:16 +08:00
committed by GitHub
parent e6b208afb3 d945a304c4
commit bdf41fc270
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0383.赎金信.md
View File

@ -88,7 +88,7 @@ public:
return false; return false;
} }
for (int i = 0; i < magazine.length(); i++) { for (int i = 0; i < magazine.length(); i++) {
// 通过recode数据记录 magazine里各个字符出现次数 // 通过record数据记录 magazine里各个字符出现次数
record[magazine[i]-'a'] ++; record[magazine[i]-'a'] ++;
} }
for (int j = 0; j < ransomNote.length(); j++) { for (int j = 0; j < ransomNote.length(); j++) {
@ -219,7 +219,7 @@ class Solution:
```go ```go
func canConstruct(ransomNote string, magazine string) bool { func canConstruct(ransomNote string, magazine string) bool {
record := make([]int, 26) record := make([]int, 26)
for _, v := range magazine { // 通过recode数据记录 magazine里各个字符出现次数 for _, v := range magazine { // 通过record数据记录 magazine里各个字符出现次数
record[v-'a']++ record[v-'a']++
} }
for _, v := range ransomNote { // 遍历ransomNote，在record里对应的字符个数做--操作 for _, v := range ransomNote { // 遍历ransomNote，在record里对应的字符个数做--操作