Leetcode每日随机2021/5/17

题

思

第一题
其实就是算一下奇数偶数
第二题
原来做过，看了下是用BFS做的。今天用dp做的。
第三题
跟两数之和一样的思路，无非就是求两数之积等于目标数。

代码

第一题

class Solution {
    public int minCostToMoveChips(int[] position) {
		Set<Integer> set = new HashSet<Integer>();
		for (int i = 0; i < position.length; i++) {
			set.add(position[i]);
		}
		int min = Integer.MAX_VALUE;
		for (int target : set) {
			int sum = 0;
			for (int i = 0; i < position.length; i++) {
				if (position[i] != target && Math.abs(position[i] - target) % 2 != 0) {
					sum++;
				}
			}
			min = Math.min(min, sum);
		}
		return min;
	}
}

第二题

class Solution {
    public int shortestPathBinaryMatrix(int[][] grid) {
		int len = grid.length;
		if (grid[0][0] == 1 ||grid[len - 1][len - 1] == 1) {
			return -1;
		}
		int[][] dp = new int[len][len];
		for (int[] is : dp) {
			Arrays.fill(is, Integer.MAX_VALUE);
		}
		dp[0][0] = 1;
		int update = 0;
		do {
			update = 0;
			for (int i = 0; i < len; i++) {
				for (int j = 0; j < len; j++) {
					if (grid[i][j] == 0) {
						int tempMin = minStep(dp, i, j);
						if (tempMin < dp[i][j]) {
							dp[i][j] = tempMin;
							update++;
						}
					}
				}
			}
		} while (update != 0);
		return dp[len - 1][len - 1] == Integer.MAX_VALUE ? -1 : dp[len - 1][len - 1];
	}

	private int minStep(int[][] dp, int row, int col) {
		int[][] pos = { { row - 1, col - 1 }, { row - 1, col }, { row - 1, col + 1 }, { row, col - 1 },
				{ row, col + 1 }, { row + 1, col - 1 }, { row + 1, col }, { row + 1, col + 1 } };
		int min = Integer.MAX_VALUE;
		for (int[] is : pos) {
			if (is[0] < 0 || is[0] == dp.length || is[1] < 0 || is[1] == dp.length) {
				continue;
			} else if (dp[is[0]][is[1]] < min) {
				min = dp[is[0]][is[1]] + 1;
			}
		}
		return min;
	}
}

第三题

class Solution {
    public int numTriplets(int[] nums1, int[] nums2) {
		int sum = 0;
		for (int num1 : nums1) {
			long a = (long)num1 * num1;
			Map<Long, Integer> map = new HashMap<Long, Integer>();
			for (int num2 : nums2) {
				if (a % num2 == 0) {
					if (map.containsKey(a / num2)) {
						sum += map.get(a / num2);
					}
					map.put((long)num2, map.getOrDefault((long)num2, 0) + 1);
				}
			}
		}
		for (int num2 : nums2) {
			long a = (long)num2 * num2;
			Map<Long, Integer> map = new HashMap<Long, Integer>();
			for (int num1 : nums1) {
				if (a % num1 == 0) {
					if (map.containsKey(a / num1)) {
						sum += map.get(a / num1);
					}
					map.put((long)num1, map.getOrDefault((long)num1, 0) + 1);
				}
			}
		}
		return sum;
	}
}