leetcode - JS

全排列问题

function permuteback(nums, index, arr) {
	//全排列
	if (nums.length-1 == index) {
		//输出
		var n = [];
		nums.forEach(element => {
			n.push(element);
		});
		arr.push(n);
	}
	else {
		//如果数据不重复 不需要 visit[] 查看
		var visit = [];
		for (var i = index; i < nums.length; i++) {
			//把它藏进数组里面
			var flag = visit.indexOf(nums[i]);
			if (flag != -1)
				continue;

			visit.push(nums[i]);

			var temp = nums[index];
			nums[index] = nums[i];
			nums[i] = temp//得到上一个index

			//递归 后面的；
			permuteback(nums, index + 1, arr);
			//换回来

			var temp = nums[index];
			nums[index] = nums[i];
			nums[i] = temp//得到上一个index
		}
	}
};

图形旋转

function rotate(matrix) {
	var numArr = [];
	//matrix[j][n-1-i]=matrix_before[i][j]
	/*
		//行变换
		swap(matrix[i][j],matrix[n-1-i][j])
		//对称轴换行
		swap(matrix[j][i],matrix[i][j]);
	 */
	var n = matrix.length;
	for (var i = 0; i < n/2; i++) {
		for (var j = 0; j < n; j++) {
			var temp = matrix[i][j];
			matrix[i][j] = matrix[n - 1 - i][j];
			matrix[n - 1 - i][j] = temp;
		}
	}
	for (var i = 0; i < n; i++) {
		for (var j = i; j < n; j++) {
			var temp = matrix[j][i];
			matrix[j][i] = matrix[i][j];
			matrix[i][j] = temp;
		}
	}
	return matrix;
}

字母异位词分组

function groupAnagrams(str) {
	//定义一个字典，存放数据
	var result = {};
	for (var i = 0; i < str.length; i++) {

		//字符串转化为字符数组 进行排序 再转回字符串
		var str_before = str[i].split("").sort().join("");
		//解决第一个 是undefined问题
		if (result[str_before] == undefined) {
			result[str_before] = str[i];
		} else {
			result[str_before] += " "+ str[i];
		}
	}
	//通过空格来进行分组
	var Arr = [];
	for (var key in result) {
		Arr.push(result[key].split(" "))
	}
	console.log(Arr);
	return Arr;
}

幂运算 pow(x,n)

• 迭代

var myPow = function(x, n) {
    if (n == 0) {
		return 1.0;
	}
	if (x == 1 ||x==-1) {
		if (x == -1 && n % 2 == 0)
			return -x;
		return x;
	}
	var flag = true;
	if (n < 0) {
		flag = false;
		if (n == 0x80000000)
			n = 0x7fffffff;
		else {
			n = 0 - n;
		}
	}

	//进行幂运算
	var sum = 1.0;
	while (n > 1) {
		if (n % 2 == 1) {
			sum *= x;
            n--;
		}
		n = n / 2;
		x = x * x;
	}
    if(!flag)
        return 1/(x*sum);
	else return x * sum;
};