1、1000以内能被7整除,或能被11整除,但不能同时被7和11整除的数,存放到一个数组中,求出满足条件的数据的个数.
算法一:
<script>
var arr = [];
var n = 0;
for (var i = 1; i < 1000; i++) {
if (i % 7 == 0 || i % 11 == 0) {
if (i % 7 == 0 && i % 11 == 0) {
continue
}
n++;
}
}
console.log("满足条件的数据的个数:" + n);
</script>
算法二:
<script>
var arr = [];
for (var i = 1; i <= 1000; i++) {
if ((i % 7 == 0 || i % 11 == 0) && !(i % 7 == 0 && i % 11 == 0)) {
arr.push(i)
}
}
console.log("满足条件的数据的个数:" + n);
</script>
2、定义一个数组1和数组2,合并成数组3,并升序排序 var arr1=[11,33,66] var arr2=[77,22];
<script>
var arr1 = [11, 33, 66];
var arr2 = [77, 22];
var arr3 = arr1.concat(arr2);
arr3 = arr3.sort(function (a, b) {
return (a - b);
})
console.log(arr3);
</script>
3、找出数组1有的数据,数组2中没有的数据,存放到数组3中 var arr1=[11,22,33,55,66] var arr2 =[22,33,88]
<script>
var arr1 = [11, 22, 33, 55, 66];
var arr2 = [22, 33, 88];
var arr3 = [];
for (var i = 0; i < arr1.length; i++) {
if (!arr2.includes(arr1[i])) {
arr3.push(arr1[i]);
}
}
console.log(arr3);// [11, 55, 66]
</script>
4.编写一个将两个字符串交叉合并的函数merge(s1,s2),例如merge(“123”,“abc”)的返回结果是"1a2b3c",如果二个字符串的长度不同, 那么就将多余的部分直接合并到结果字符串的末尾,如merge(“123456”, “abc”)的返回结果是"1a2b3c456"。
算法一:
<script>
function merge(str1, str2) {
var str = '';//定义一个空的字符串
if (str1.length >= str.length) {
for (var i = 0; i < str2.length; i++) {
str = str1[i] + str2[i];
}
str = str + str1.slice(str2.length)
} else {
for(var i = 0;i <str1.length;i++) {
str = str1[i] + str2[i];
}
str = str + str1.slice(str2.length)
}
return str;
}
var s = merge("ling","123456");
console.log(s);
</script>
算法二:
<script>
function merge(s1, s2) {
var str = "";
for (var i = 0; i < s1.length || i < s2.length; i++) {
str += s1.charAt(i);
str += s2.charAt(i);
}
return str;
}
var str1 = "123456";
var str2 = "ab";
var str = merge(str1, str2);
console.log(str);
<script>