--- id: 56533eb9ac21ba0edf2244c6 title: Stand in Line challengeType: 1 videoUrl: '' localeTitle: 站在队中 --- ## Description
在计算机科学中, 队列是一个抽象的数据结构 ,其中项目按顺序保存。可以在queue的后面添加新项目,并从queue的前面取出旧项目。编写一个函数nextInLine ,它接受一个数组( arr )和一个数字( item )作为参数。将数字添加到数组的末尾,然后删除数组的第一个元素。然后, nextInLine函数应返回已删除的元素。
## Instructions
## Tests
```yml tests: - text: 'nextInLine([], 5)应返回一个数字。' testString: 'assert.isNumber(nextInLine([],5), "nextInLine([], 5) should return a number.");' - text: 'nextInLine([], 1)应该返回1' testString: 'assert(nextInLine([],1) === 1, "nextInLine([], 1) should return 1");' - text: 'nextInLine([2], 1)应返回2' testString: 'assert(nextInLine([2],1) === 2, "nextInLine([2], 1) should return 2");' - text: 'nextInLine([5,6,7,8,9], 1)应该返回5' testString: 'assert(nextInLine([5,6,7,8,9],1) === 5, "nextInLine([5,6,7,8,9], 1) should return 5");' - text: '在nextInLine(testArr, 10)testArr[4]应为10' testString: 'nextInLine(testArr, 10); assert(testArr[4] === 10, "After nextInLine(testArr, 10), testArr[4] should be 10");' ```
## Challenge Seed
```js function nextInLine(arr, item) { // Your code here return item; // Change this line } // Test Setup var testArr = [1,2,3,4,5]; // Display Code console.log("Before: " + JSON.stringify(testArr)); console.log(nextInLine(testArr, 6)); // Modify this line to test console.log("After: " + JSON.stringify(testArr)); ```
### Before Test
```js var logOutput = []; var originalConsole = console function capture() { var nativeLog = console.log; console.log = function (message) { logOutput.push(message); if(nativeLog.apply) { nativeLog.apply(originalConsole, arguments); } else { var nativeMsg = Array.prototype.slice.apply(arguments).join(' '); nativeLog(nativeMsg); } }; } function uncapture() { console.log = originalConsole.log; } capture(); ```
### After Test
```js console.info('after the test'); ```
## Solution
```js // solution required ```