|
| 1 | +//Task1 |
| 2 | +let developer1 = { |
| 3 | + skills: ['JavaScript', 'linux', 'html', 'OOP', 'Node.js'], |
| 4 | + requirements: ['Node.js', 'JavaScript', 'OOP'], |
| 5 | + goodDev: goodDev |
| 6 | +}; |
| 7 | +let developer2 = { |
| 8 | + experience: [ |
| 9 | + { technology: 'java' }, |
| 10 | + { technology: 'c++' }, |
| 11 | + { technology: 'aws' }, |
| 12 | + { technology: 'docker' } |
| 13 | + ], |
| 14 | + requirements: ['java', 'json', 'c++', 'JavaScript'], |
| 15 | + goodDev: goodDev |
| 16 | +}; |
| 17 | + |
| 18 | +function goodDev (dev) { |
| 19 | + let developerRequirements = this.requirements; |
| 20 | + if(this.skills) { |
| 21 | + let developerSkills = this.skills; |
| 22 | + developerRequirements.forEach((initialElem) => { |
| 23 | + let comparison = developerSkills.some((developerSkills) => { |
| 24 | + for(let key in developerSkills) { |
| 25 | + return developerSkills == initialElem |
| 26 | + }; |
| 27 | + return initialElem == developerSkills; |
| 28 | + }); |
| 29 | + if (comparison) { |
| 30 | + console.log( `required: ${initialElem} ...success`); |
| 31 | + } else { |
| 32 | + console.log( `required: ${initialElem} ...fail`); |
| 33 | + }; |
| 34 | + }); |
| 35 | + } else if(this.experience) { |
| 36 | + let developerExperience = this.experience; |
| 37 | + developerRequirements.forEach((initialElem) => { |
| 38 | + let comparison = developerExperience.some((developerExperience) => { |
| 39 | + for(let key in developerExperience) { |
| 40 | + return developerExperience[key] == initialElem; |
| 41 | + }; |
| 42 | + return initialElem == developerExperience; |
| 43 | + }); |
| 44 | + if (comparison) { |
| 45 | + console.log( `Task1---> required: ${initialElem} ...success`); |
| 46 | + } else { |
| 47 | + console.log( `Task1---> required: ${initialElem} ...fail`); |
| 48 | + }; |
| 49 | + }); |
| 50 | + }; |
| 51 | +}; |
| 52 | + |
| 53 | +developer1.goodDev(); |
| 54 | +developer2.goodDev(); |
| 55 | + |
| 56 | + |
| 57 | +//Task2 |
| 58 | +let myObject = { |
| 59 | + database: [ |
| 60 | + { age: 100, name: 'b' }, |
| 61 | + { age: 15, name: 'c' }, |
| 62 | + { age: 25, name: 'a' } |
| 63 | + ] |
| 64 | +}; |
| 65 | + |
| 66 | +myObject.myFilter = function(param) { |
| 67 | + let tmp = [...this.database]; |
| 68 | + let fnSort = function (arg1, arg2) { |
| 69 | + return arg1[param] > arg2[param]; |
| 70 | + }; |
| 71 | + return tmp.sort(fnSort); |
| 72 | +}; |
| 73 | + |
| 74 | +console.log('Task2--->', myObject.myFilter('age')); |
| 75 | +console.log('Task2--->', myObject.myFilter('name')); |
| 76 | + |
| 77 | +myObject.myFilter2 = function(param) { |
| 78 | + let fnSort = function (arg1, arg2) { |
| 79 | + return arg1[param] > arg2[param]; |
| 80 | + }; |
| 81 | + return this.database.sort(fnSort); |
| 82 | +}; |
| 83 | + |
| 84 | +// {age:15, name:'c'}, {age:25, name:'a'} {age:100, name:'b'} |
| 85 | +console.log('Task2--->', myObject.myFilter2('age')); |
| 86 | + |
| 87 | +// {age:25, name:a}, {age:100, name: b} ... |
| 88 | +//console.log('Task2--->', myObject.myFilter2('name')); |
| 89 | + |
| 90 | + |
| 91 | +//Task3 |
| 92 | +//1 |
| 93 | +let arr1 = [1, false, 2, 0, 3, null, 0, 4, 0, 25]; |
| 94 | +let arr2 = ['a', 0, 0, 'b', null, 'c', 'd', 0, 1, |
| 95 | + false, 0, 1, 0, 3, [], 0, 1, 9, 0, 0, {}, 0, 0, 9]; |
| 96 | + |
| 97 | +let moveZeroToEnd = (arr) => { |
| 98 | + let arrayWithoutZeros = []; |
| 99 | + let arrZero = []; |
| 100 | + arr.forEach((elem) => { |
| 101 | + if(elem != 0) { |
| 102 | + arrayWithoutZeros.push(elem); |
| 103 | + }; |
| 104 | + if (elem === 0) { |
| 105 | + arrZero.push(elem); |
| 106 | + }; |
| 107 | + }); |
| 108 | + let newArr = arrayWithoutZeros.concat(arrZero); |
| 109 | + return newArr; |
| 110 | +}; |
| 111 | + |
| 112 | +console.log('Task3---> Задание 1 --> нули в конце массива ', moveZeroToEnd(arr1)); |
| 113 | +console.log('Task3---> Задание 1 --> нули в конце массива ', moveZeroToEnd(arr2)); |
| 114 | + |
| 115 | +let moveZeroToEnd2 = (arr) => { |
| 116 | + return arr.filter((elem) => elem != 0).concat(arr.filter((elem) => elem === 0)); |
| 117 | +}; |
| 118 | +console.log('Task3---> Задание 1 --> нули в конце массива ', moveZeroToEnd2(arr1)); |
| 119 | +console.log('Task3---> Задание 1 --> нули в конце массива ', moveZeroToEnd2(arr2)); |
| 120 | + |
| 121 | +//2 |
| 122 | +let arrayOfNumbers = [1,200,10,1,1,25,15]; |
| 123 | +//let arrayOfNumbers = [10,20,30,1,31,11,10]; |
| 124 | +//let arrayOfNumbers = [-1,0,25]; |
| 125 | +//let arrayOfNumbers = [-4,-10,25,10]; |
| 126 | + |
| 127 | +let minNamber = (arr) => { |
| 128 | + let min = arr[0]; |
| 129 | + arr.forEach((elem) => { |
| 130 | + if(elem < min) { |
| 131 | + min = elem; |
| 132 | + }; |
| 133 | + }); |
| 134 | + return min; |
| 135 | +}; |
| 136 | + |
| 137 | +let addTwoMin = (arr) => { |
| 138 | + let newArr2 = []; |
| 139 | + let firstNumber = minNamber(arr); |
| 140 | + let firstNumberIndex; |
| 141 | + for (let i = 0; i < arr.length; i++) { |
| 142 | + if (arr[i] === firstNumber) { |
| 143 | + firstNumberIndex = i; |
| 144 | + break; |
| 145 | + }; |
| 146 | + }; |
| 147 | + for (let i = 0; i < arr.length; i++) { |
| 148 | + if (i === firstNumberIndex) { |
| 149 | + continue; |
| 150 | + }; |
| 151 | + newArr2.push(arr[i]); |
| 152 | + }; |
| 153 | + let secondNumber = minNamber(newArr2); |
| 154 | + return firstNumber + secondNumber; |
| 155 | +}; |
| 156 | + |
| 157 | +console.log('Task3---> Задание 2 --> Сумма двух минимальных в массиве ',addTwoMin(arrayOfNumbers)); |
| 158 | + |
| 159 | + |
| 160 | +//3 |
| 161 | +let strNameShuffler ='Arnold Schwarzenegger'; |
| 162 | +let nameShuffler = (str) => { |
| 163 | + let arrStr = str.split(' '); |
| 164 | + let arrStrReverse = arrStr.reverse(); |
| 165 | + return arrStrReverse.join(' '); |
| 166 | +}; |
| 167 | +console.log('Task3---> Задание 3', nameShuffler(strNameShuffler)); |
| 168 | + |
| 169 | + |
| 170 | +//4 |
| 171 | +//let arrCapMe = ['jo', 'nelson', 'jurie']; |
| 172 | +let arrCapMe = ['KARLY', 'DANIEL', 'KELSEY']; |
| 173 | +let capMe = (arr) => { |
| 174 | + let resArrCapMe = arr.map((elem) =>{ |
| 175 | + let elemArr = elem; |
| 176 | + let firstCapitalLetter = elemArr.charAt(0).toUpperCase(); |
| 177 | + let theRestSmall = elemArr.slice(1, elemArr.length).toLowerCase(); |
| 178 | + let concatVersion = firstCapitalLetter.concat(theRestSmall); |
| 179 | + return concatVersion; |
| 180 | + }); |
| 181 | + return resArrCapMe; |
| 182 | +}; |
| 183 | +console.log('Task3---> Задание 4', capMe(arrCapMe)); |
| 184 | + |
| 185 | +//@SUPER 2 |
| 186 | + let firstArray1 = [25,10,[10,[15]]]; |
| 187 | + |
| 188 | +let changeArr = (arr) => { |
| 189 | + if (Array.isArray(arr)) { |
| 190 | + return arr.reduce((done,curr) => { |
| 191 | + return done.concat(changeArr(curr)); |
| 192 | + }, []); |
| 193 | + } else { |
| 194 | + return arr; |
| 195 | + }; |
| 196 | +}; |
| 197 | + |
| 198 | +console.log('Task3--->', changeArr(firstArray1)); |
0 commit comments