Advertisement
Kuncavia

searchArray

Dec 18th, 2018
131
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. const getGets = (arr) => {
  2.     let index = 0;
  3.  
  4.     return () => {
  5.         const toReturn = arr[index];
  6.         index += 1;
  7.         return toReturn;
  8.     };
  9. };
  10. // this is the test
  11. const test = [
  12.     '4,3,2,7,8,2,3,1'
  13. ];
  14.  
  15. const gets = this.gets || getGets(test);
  16. const print = this.print || console.log;
  17.  
  18. let numbers = gets().split(',').map(Number);
  19. let count = numbers.length;
  20. //let missing = [];
  21.  
  22. function missNums(numbers) {
  23.     let missing = -1;
  24.     let sorted = numbers.sort(function(a, b) {return a - b; });
  25.  
  26.     for (let i = sorted[0]; i <= numbers.length - 1; i++) {
  27.         if (numbers.indexOf(i) === - 1) {
  28.             missing = i;
  29.         }
  30.     }
  31.  
  32. }
  33.  
  34. // numbers.sort((a,b) => a - b);
  35.  
  36. // for (let i = 0; i < numbers.length; i++) {
  37. //     if (numbers[i] === i) {
  38. //         numbers.slice(i);
  39. //     } else {
  40. //         continue;
  41. //     }
  42. // }
  43.  
  44. // for (let i = 1; i < count; i++) {
  45. //     if (numbers.indexOf(i) == -1) {
  46. //         missing.push(i);
  47. //     }
  48. // }
  49.  
  50. print(numbers);
  51. //print(missing);
  52. print(missNums(numbers));
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement