Skip to content

[pull] master from youngyangyang04:master #418

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

pull merged 2 commits into AlgorithmAndLeetCode:master from youngyangyang04:master

Feb 10, 2024

Merged

[pull] master from youngyangyang04:master #418

Changes from all commits

Commits

Show all changes

Select commit Hold shift + click to select a range

Update 0383.赎金信.md,添加c语言版本解法

qiuzidian Jan 29, 2024

Merge pull request #2430 from qiuzidian/patch-1

youngyangyang04 Feb 10, 2024

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

19 changes: 19 additions & 0 deletions problems/0383.赎金信.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -445,6 +445,25 @@ public bool CanConstruct(string ransomNote, string magazine) {
		return true;
		}

	```

	### C:

	```c
	bool canConstruct(char* ransomNote, char* magazine) {
	// 定义哈希映射数组
	int hashmap[26] = {0};
	// 对magazine中字符计数
	while (magazine != '0円') hashmap[magazine++ % 26]++;
	// 遍历ransomNote,对应的字符自减,小于0说明该字符magazine没有或不足够表示
	while (ransomNote != '0円') hashmap[ransomNote++ % 26]--;
	// 如果数组中存在负数,说明ransomNote不能由magazine里面的字符构成
	for (int i = 0; i < 26; i++) {
	if (hashmap[i] < 0) return false;
	}
	return true;
	}

		```
		<p align="center">
		<a href="https://programmercarl.com/other/kstar.html" target="_blank">
Expand Down