How to use recursion to write a function to achieve the effect of js's Array.prototype.fill () method

comes from an interview question. I haven"t thought about it for a long time.

the title is as follows 
function fill (n, m) {
    //
}
console.log(fill(3, 4))    // [4,4,4]

to implement

with recursion

Please let me know!

Javascript
Mar.16,2021 
function fill (n, m) {
    n--
    if(n) {
        return [m].concat(fill(n, m))
    } else {
        return m
    }
}
The

PS: Array.prototype.fill () method is not like this.

first of all, you need to know the fill implementation of array, file (v [, start [, end]]) where v is the value to be replaced, start is the start position, and end is the end position, that is, elements from start to end are always replaced with v in the array.
if you ask for the title, this is not the case at all.

Previous: No delete function?

Next: Input text box can not be entered, how to solve the problem

css mysql arrays josn react html typescript webpack npm sass R objective-c .net sql-server jquery python-3.x angularjs django angular excel regex iphone ajax linux xml pandas vba spring database wordpress string wpf xcode windows bash postgresql oracle multithreading eclipse list firebase algorithm macos forms image scala visual-studio azure bootstrap spring-boot react-native python-2.7 docker performance function winforms matlab powershell apache dataframe api sqlite numpy rest shell selenium flutter dart maven loops qt swing android-studio csv express file class tensorflow sorting codeigniter perl
© 2021 CodesHelper
Advertising Contact us About us
Menu