前端面试中的一些算法题

算法题目：

1、两个有序数组合并后排序

		let a = [1,6,9,100];
		let b = [8,10,23,24,25,32,34,38,43,45,56];
		function concat_sort(arr1,arr2){
			let res = new Array(arr1.length + arr2.length),
			leftIndex = 0,
			rightIndex = 0,
			resIndex = 0;
			while(leftIndex < arr1.length && rightIndex < arr2.length){
				if(arr1[leftIndex] < arr2[rightIndex]){
					res[resIndex++] = arr1[leftIndex++];
				}else{
					res[resIndex++] = arr2[rightIndex++];
				}

			}
			while(rightIndex < arr2.length){
				res[resIndex++] = arr2[rightIndex++];
			}
			while(leftIndex < arr1.length){
				res[resIndex++] = arr1[leftIndex++];
			}
			return res;
		}
		console.log(concat_sort(a,b));//[1,6,8,9,10,23,24,25,32,34,38,43,45,56,100]

2.判断一个字符串是否是回文

如 “上海自来水来自海上”，从前向后读和从后向前读都是一样的