w3c js 字符配对算法挑战

function pair(str) {
	var arr = [];
	str = str.split('');
	var i = 0;
	while (i < str.length) {
		switch (str[i]) {
			case "A":
				arr.push(["A", "T"]);
			break;
			case "T":
				arr.push(["T", "A"]);
			break;
			case "C":
				arr.push(["C", "G"]);
			break;
			case "G":
				arr.push(["G", "C"]);
			break;
		}
		i++;
	}
	console.log(arr)
	return arr;
}