feat: add TS solution to lc problem No.290 #2969

Original file line number	Diff line number	Diff line change
Expand Up		@@ -261,4 +261,36 @@ public class Solution {

		<!-- solution:end -->

	<!-- solution:start -->

	### 方法二:哈希表的另一种写法

	<!-- tabs:start -->

	#### TypeScript

	```ts
	function wordPattern(pattern: string, s: string): boolean {
	const hash: Record<string, string> = Object.create(null);
	const arr = s.split(/\s+/);

	if (pattern.length !== arr.length \|\| new Set(pattern).size !== new Set(arr).size) {
	return false;
	}

	for (let i = 0; i < pattern.length; i++) {
	hash[pattern[i]] ??= arr[i];
	if (hash[pattern[i]] !== arr[i]) {
	return false;
	}
	}

	return true;
	}
	```

	<!-- tabs:end -->

	<!-- solution:end -->

		<!-- problem:end -->

32 changes: 32 additions & 0 deletions solution/0200-0299/0290.Word Pattern/README_EN.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -262,4 +262,36 @@ public class Solution {

		<!-- solution:end -->

	<!-- solution:start -->

	### Solution 2

	<!-- tabs:start -->

	#### TypeScript

	```ts
	function wordPattern(pattern: string, s: string): boolean {
	const hash: Record<string, string> = Object.create(null);
	const arr = s.split(/\s+/);

	if (pattern.length !== arr.length \|\| new Set(pattern).size !== new Set(arr).size) {
	return false;
	}

	for (let i = 0; i < pattern.length; i++) {
	hash[pattern[i]] ??= arr[i];
	if (hash[pattern[i]] !== arr[i]) {
	return false;
	}
	}

	return true;
	}
	```

	<!-- tabs:end -->

	<!-- solution:end -->

		<!-- problem:end -->

17 changes: 17 additions & 0 deletions solution/0200-0299/0290.Word Pattern/Solution2.ts

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,17 @@
	function wordPattern(pattern: string, s: string): boolean {
	const hash: Record<string, string> = Object.create(null);
	const arr = s.split(/\s+/);

	if (pattern.length !== arr.length \|\| new Set(pattern).size !== new Set(arr).size) {
	return false;
	}

	for (let i = 0; i < pattern.length; i++) {
	hash[pattern[i]] ??= arr[i];
	if (hash[pattern[i]] !== arr[i]) {
	return false;
	}
	}

	return true;
	}

Navigation Menu