https://leetcode.cn/problems/array-reduce-transformation/ https://leetcode.cn/problems/curry

Author: masx200

README.md

@@ -49,6 +49,10 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/array-reduce-transformation/
+
+https://leetcode.cn/problems/curry
+
 https://leetcode.cn/problems/memoize-ii/
 
 https://leetcode.cn/problems/cache-with-time-limit/

array-reduce-transformation/index.ts

@@ -0,0 +1,10 @@
+type Fn = (accum: number, curr: number) => number;
+
+function reduce(nums: number[], fn: Fn, init: number): number {
+    for (const v of nums) {
+        init = fn(init, v);
+    }
+    return init;
+}
+export { reduce as default };
+export type { Fn };

curry/index.ts

@@ -0,0 +1,19 @@
+// deno-lint-ignore ban-types
+function curry(fn: Function): Function {
+    const length = fn.length;
+    return function curried(...args: any[]) {
+        if (args.length === length) return fn(...args);
+        if (args.length < length) {
+            return curry(fn.bind(null, ...args));
+        }
+        throw new Error("arguments length mismatch");
+    };
+}
+
+/**
+ * function sum(a, b) { return a + b; }
+ * const csum = curry(sum);
+ * csum(1)(2) // 3
+ */
+
+export default curry;