g2601_2700.s2623_memoize.solution.ts Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
// #Medium #2023_08_31_Time_264_ms_(97.20%)_Space_109.2_MB_(32.97%)
type Fn = (...params: any) => any
function memoize(fn: Fn): Fn {
const mem_args: Map = new Map()
return function (...args) {
const args_str = args.toString()
if (mem_args.has(args_str)) {
return mem_args.get(args_str)
}
const result = fn(...args)
mem_args.set(args_str, result)
return result
}
}
/*
* let callCount = 0;
* const memoizedFn = memoize(function (a, b) {
* callCount += 1;
* return a + b;
* })
* memoizedFn(2, 3) // 5
* memoizedFn(2, 3) // 5
* console.log(callCount) // 1
*/
export { memoize }
© 2015 - 2024 Weber Informatics LLC | Privacy Policy