Skip to content

Commit 059ae92

Browse files
committed
fix python template problem for prefix sum
1 parent e73da5d commit 059ae92

File tree

2 files changed

+2
-10
lines changed

2 files changed

+2
-10
lines changed

src/data/patterns.json

Lines changed: 1 addition & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -74,15 +74,7 @@
7474
"title": "Prefix Sum",
7575
"description": "Used for fast range sum queries and subarray sum problems. There are two common implementations: (1) with an extra 0 at the start, and (2) without it (0-based).",
7676
"templates": {
77-
"python": "# Version 1: With extra 0 at the start (simpler range queries)\n"
78-
"prefix = [0] * (len(arr) + 1)\n"
79-
"for i in range(len(arr)):\n"
80-
" prefix[i + 1] = prefix[i] + arr[i]\n\n"
81-
"# Version 2: Without extra 0 (0-based indexing)\n"
82-
"prefix = [0] * len(arr)\n"
83-
"prefix[0] = arr[0]\n"
84-
"for i in range(1, len(arr)):\n"
85-
" prefix[i] = prefix[i - 1] + arr[i]",
77+
"python": "# Version 1: With extra 0 at the start (simpler range queries)\\nprefix = [0] * (len(arr) + 1)\\nfor i in range(len(arr)):\\n prefix[i + 1] = prefix[i] + arr[i]\\n\\n# Version 2: Without extra 0 (0-based indexing)\\nprefix = [0] * len(arr)\\nprefix[0] = arr[0]\\nfor i in range(1, len(arr)):\\n prefix[i] = prefix[i - 1] + arr[i]",
8678
"javascript": "// Version 1: With extra 0 at the start (simpler range queries)\nconst prefix = new Array(arr.length + 1).fill(0);\nfor (let i = 0; i < arr.length; i++) {\n prefix[i + 1] = prefix[i] + arr[i];\n}\n\n// Version 2: Without extra 0 (0-based indexing)\nconst prefix2 = new Array(arr.length).fill(0);\nprefix2[0] = arr[0];\nfor (let i = 1; i < arr.length; i++) {\n prefix2[i] = prefix2[i - 1] + arr[i];",
8779
"java": "// Version 1: With extra 0 at the start (simpler range queries)\nint[] prefix = new int[arr.length + 1];\nfor (int i = 0; i < arr.length; i++) {\n prefix[i + 1] = prefix[i] + arr[i];\n}\n\n// Version 2: Without extra 0 (0-based indexing)\nint[] prefix2 = new int[arr.length];\nprefix2[0] = arr[0];\nfor (int i = 1; i < arr.length; i++) {\n prefix2[i] = prefix2[i - 1] + arr[i];",
8880
"go": "// Version 1: With extra 0 at the start (simpler range queries)\nprefix := make([]int, len(arr)+1)\nfor i := 0; i < len(arr); i++ {\n prefix[i+1] = prefix[i] + arr[i]\n}\n\n// Version 2: Without extra 0 (0-based indexing)\nprefix2 := make([]int, len(arr))\nprefix2[0] = arr[0]\nfor i := 1; i < len(arr); i++ {\n prefix2[i] = prefix2[i-1] + arr[i];"

src/pages/Patterns.jsx

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -100,7 +100,7 @@ return (
100100
</div>
101101
<pre className="bg-gray-800 text-gray-100 rounded-lg p-4 overflow-x-auto border-2 border-gray-700">
102102
<code className="text-sm font-mono whitespace-pre">
103-
{pattern.templates[selectedLanguage]}
103+
{pattern.templates[selectedLanguage].replace(/\\n/g, "\n")}
104104
</code>
105105
</pre>
106106
</div>

0 commit comments

Comments
 (0)