If the current element is greater than the minimum element, remove the minimum element and add the current element to the new array.įinally, return the new array with the k maximum elements in original order as they appeared in the input array. If the new array has k elements, compare the current element with the minimum element in the new array.

The slice() method selects from a given start, up to a (not inclusive) given end. If the new array has less than k elements, simply add the current element to the new array. The slice() method returns selected elements in an array, as a new array. Loop through the input array and compare each element with the elements in the new array. The approach to find k maximum elements of an array in original order can be described as follows −Ĭreate a new empty array to store the k maximum elements. By preserving the original order of the elements, the significance and context of the data remains intact, making it easier for us to analyze and interpret the results. Firstly, we sort the array in descending order, and then slice it from the beginning to the kth index to obtain the k maximum elements. Enable JavaScript to view data.We will be using the JavaScript array sort method and slicing technique to find the k maximum elements of an array in their original order. min (end, len ) : len if (end 0 ) ( ) ) 規範 SpecificationĮCMAScript Language Specification # īCD tables only load in the browser with JavaScript enabled. max ( 0, len + start ) // Handle negative value for 'end' var upTo = ( typeof end = 'number' ) ? Math. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. * Shim for 'fixing' IE's lack of support (IE = 0 ) ? start : Math. Object.prototype._lookupSetter_() (en-US) 已棄用.

Object.prototype._lookupGetter_() (en-US) 已棄用.Object.prototype._defineSetter_() (en-US) 已棄用.Object.prototype._defineGetter_() (en-US) 已棄用.

Node js array slice