Here you can find the source of rotate(n)
Array.prototype.rotate = function(n) { this.unshift.apply(this, this.splice(n + 1, this.length)) return this;//from w ww . jav a2s . co m } var arr = [1, 2, 3, 4, 5]; var arr1 = [1, 2, 3, 4, 5]; /* * Implement a function rotateArray(vector<int> arr, int r) which rotates the array by r places. Eg 1 2 3 4 5 on being rotated by 2 gives 4 5 1 2 3. */ var rotate = function(arr, r) { arr.unshift.apply(arr, arr.splice(r + 1, arr.length)); }; rotate(arr, 2); console.log(arr); // arr1.rotate(2); // console.log(arr1);
Array.prototype.rotate = (function(){ var unshift = Array.prototype.unshift, push=Array.prototype.push, splice=Array.prototype.splice; return function(count){ var len=this.length >>>0, count = count >> 0; count = count % len; push.apply(this,splice.call(this,count,len)); ...
'use strict'; Array.prototype.rotate = (function() { var unshift = Array.prototype.unshift; var splice = Array.prototype.splice; return function(count) { var len = this.length >>> 0; count = count >> 0; unshift.apply(this, splice.call(this, count % len, len)); return this; ...
export function zeroOrOne() { return Math.round(Math.random() * 1) export function arrayShuffle(a) { let j, x, i; for (i = a.length; i; i -= 1) { j = Math.floor(Math.random() * i); x = a[i - 1]; a[i - 1] = a[j]; ...
Array.prototype.rotate = function (K){ var N = this.length; if( N < 1 || K < 1 || K > N ){ return this; this.reverse(0, N - K - 1); this.reverse(N-K, N-1); this.reverse(); return this; ...
Array.prototype.rotate = function(count) var len = this.length >>> 0, count = count >> 0; count = ((count % len) + len) % len; var copy = this.clone(this); push.apply(copy, splice.call(copy, 0, count)); return copy; }; ...
var a = (function() { var a = []; for (var i = 0; i < 35; i++) { a.push(i) }; return a; }()) Array.prototype.rotate = function(n) { var a = this.concat(this.splice(0, n)) return a a.rotate(12) function findI(arr, i) { if (arr.length == 2) { return i+1 } var k = (arr.length/2).floor(), i = i || 0 ...
Array.prototype.rotate = function(times) { if (times < 0) { var last = arr.pop return arr.unshift(last) function solution (numbers, times) { for (var i = 0; i < times; i++) { numbers.rotate ...
Array.prototype.rotateArray = function (n) { let firstArray = []; let secondArray = []; for (let i = this.length - 1; i > this.length - n - 1; i--) { firstArray.unshift(this[i]); for (let j = 0; j < this.length - n; j++) { secondArray[secondArray.length] = this[j]; return firstArray.concat(secondArray); function createArray() { let valuesStr = prompt("Enter an Array : "); let arrayStr = valuesStr.split(" "); let array = []; for (let i = 0; i < arrayStr.length; i++) { if (arrayStr[i] ) array[array.length] = Number(arrayStr[i]); return array; let array = createArray(); console.log(array.rotateArray(3));
Array.prototype.rotate_copy = function (begin, middle, end) { var back = this.slice (begin, middle - begin); back.unshift (0); back.unshift (end - middle); var front = this.slice (middle, end); front.splice.apply (front, back); return front; };