473. Matchsticks to Square

Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.

Your input will be several matchsticks the girl has, represented with their stick length. Your output will either be true or false, to represent whether you could make one square using all the matchsticks the little match girl has.

Example 1:

Input: [1,1,2,2,2]
Output: true

Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.

Example 2:

Input: [3,3,3,3,4]
Output: false

Explanation: You cannot find a way to form a square with all the matchsticks.

Note:

  1. The length sum of the given matchsticks is in the range of 0 to 10^9.
  2. The length of the given matchstick array will not exceed 15.
思路:最开始想用BFS,遍历完最后看是否出现过sum/4,2*sum/4,3*sum/4
wrong idea : 考虑1,1,4,4,2,3,2,3如果2,2,1组合就没戏唱了
package l473;

import java.util.HashSet;
import java.util.Set;

/*
 * 想用完全背包
 * 仔细一想其实并不需要那么复杂
 * 
 * 分成2步
 * 1. 把数组分成和相等的2部分
 * 2. 把2部分再分别等分
 * 如果2步都OK,那就return true
 * 
 * 其实一步就好,BFS,每个数据都可取或者不取
 * 最后看是否出现过sum/4,2*sum/4,3*sum/4
 * 
 * wrong idea : 考虑1,1,4,4,2,3,2,3如果2,2,1组合就没戏唱了
 * 
 * The length of the given matchstick array will not exceed 15.或者还可以穷举?
 */
public class BFS_WA {
	
    public boolean makesquare(int[] nums) {
    	if(nums == null || nums.length == 0)	return false;
    	int sum = 0;
    	for(int i : nums)	sum+=i;
    	if(sum % 4 != 0)	return false;
    	
    	Set<Integer> s = new HashSet<Integer>();
    	Set<Integer> ss = new HashSet<Integer>();
    	s.add(0);
    	
    	// bfs
    	for(int i : nums) {
    		if(i > sum/4)	return false;
    		for(int j : s)
    			ss.add(j+i);
    		s.addAll(ss);
    		ss.clear();
    	}
    	
        return s.contains(sum/4) && s.contains(sum/2) && s.contains(sum/4*3);
    }

}


那就DFS,先降序排列会提高速度,因为数据大先填的坑就大,后面只能填一些小的,需要遍历的情况就更小
 
package l473;

import java.util.Arrays;


/*
 * DFS
 * 先降序排列会提高速度,因为数据大先填的坑就大,后面只能填一些小的,需要遍历的情况就更小
 */
public class Solution {
	
	int[] edge =  new int[4];
	boolean f = false;
	
    public boolean makesquare(int[] nums) {
    	if(nums == null || nums.length == 0)	return false;
    	int sum = 0;
    	for(int i : nums)	sum+=i;
    	if(sum % 4 != 0)	return false;
    	
    	Arrays.sort(nums);
    	dfs(nums, sum/4, nums.length-1);
    	
        return f;
    }

	private void dfs(int[] nums, int max, int s) {
		if(f)	return;
		
		if(s == -1) {
			if(edge[0]==max && edge[1]==max && edge[2]==max) {
				f = true;
				return;
			}
		}
		
		// a little more pruning to AC if not sort
		for(int i=0; i<4 && !f; i++) {
			if(edge[i]+nums[s] <= max) {
				edge[i] += nums[s];
				dfs(nums, max, s-1);
				edge[i] -= nums[s];	
			}
		}
	}

}



好的,下面给出一个简单的 Java Swing 代码实现: ```java import java.awt.*; import java.awt.event.*; import javax.swing.*; public class MatchsticksGame extends JFrame { private int totalMatchsticks, maxMatchsticksPerTurn; private boolean computerFirst; private JLabel statusLabel, matchsticksLabel; private JButton takeButton; private JTextArea historyTextArea; private int currentMatchsticks, turnCount; private boolean isComputerTurn, gameOver; public MatchsticksGame(int totalMatchsticks, boolean computerFirst, int maxMatchsticksPerTurn) { super("Matchsticks Game"); this.totalMatchsticks = totalMatchsticks; this.computerFirst = computerFirst; this.maxMatchsticksPerTurn = maxMatchsticksPerTurn; currentMatchsticks = totalMatchsticks; turnCount = 0; isComputerTurn = computerFirst; gameOver = false; statusLabel = new JLabel("Game started. " + (isComputerTurn ? "Computer" : "User") + " goes first."); matchsticksLabel = new JLabel(getMatchsticksString(currentMatchsticks)); takeButton = new JButton("Take"); takeButton.addActionListener(new TakeButtonListener()); historyTextArea = new JTextArea(10, 40); historyTextArea.setEditable(false); JScrollPane scrollPane = new JScrollPane(historyTextArea); JPanel topPanel = new JPanel(); topPanel.add(statusLabel); topPanel.add(Box.createHorizontalStrut(20)); topPanel.add(takeButton); topPanel.add(Box.createHorizontalStrut(20)); topPanel.add(matchsticksLabel); JPanel bottomPanel = new JPanel(); bottomPanel.add(scrollPane); setLayout(new BorderLayout()); add(topPanel, BorderLayout.NORTH); add(bottomPanel, BorderLayout.SOUTH); pack(); setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); setVisible(true); if (computerFirst) { takeMatches(computeBestMove()); isComputerTurn = false; } } private String getMatchsticksString(int count) { StringBuilder sb = new StringBuilder(); for (int i = 0; i < count; i++) { sb.append("| "); } return sb.toString(); } private int computeBestMove() { // TODO: Implement Minimax algorithm to compute best move return 1; } private void takeMatches(int count) { int actualCount = Math.min(count, maxMatchsticksPerTurn); currentMatchsticks -= actualCount; matchsticksLabel.setText(getMatchsticksString(currentMatchsticks)); historyTextArea.append((isComputerTurn ? "Computer" : "User") + " takes " + actualCount + " matchsticks.\n"); if (currentMatchsticks == 1) { gameOver = true; statusLabel.setText((isComputerTurn ? "Computer" : "User") + " wins!"); historyTextArea.append((isComputerTurn ? "Computer" : "User") + " wins!\n"); takeButton.setEnabled(false); } else { isComputerTurn = !isComputerTurn; statusLabel.setText("Current turn: " + (isComputerTurn ? "Computer" : "User")); if (isComputerTurn) { takeMatches(computeBestMove()); } } } private class TakeButtonListener implements ActionListener { public void actionPerformed(ActionEvent e) { if (!gameOver && !isComputerTurn) { try { int count = Integer.parseInt(JOptionPane.showInputDialog("Please enter the number of matchsticks to take:")); if (count < 1 || count > maxMatchsticksPerTurn || count > currentMatchsticks - 1) { JOptionPane.showMessageDialog(null, "Invalid number of matchsticks. Please try again."); } else { takeMatches(count); } } catch (NumberFormatException ex) { JOptionPane.showMessageDialog(null, "Invalid number format. Please try again."); } } } } public static void main(String[] args) { int totalMatchsticks = Integer.parseInt(JOptionPane.showInputDialog("Please enter the total number of matchsticks:")); boolean computerFirst = JOptionPane.showConfirmDialog(null, "Do you want the computer to go first?", "Choose", JOptionPane.YES_NO_OPTION) == JOptionPane.YES_OPTION; int maxMatchsticksPerTurn = Integer.parseInt(JOptionPane.showInputDialog("Please enter the maximum number of matchsticks per turn:")); new MatchsticksGame(totalMatchsticks, computerFirst, maxMatchsticksPerTurn); } } ``` 这个代码实现了一个简单的图形界面,用户可以输入游戏参数,并通过按钮和文本框与计算机进行交互。具体来说,用户每次点击按钮,程序会弹出一个对话框让用户输入拿走的火柴数,然后根据用户的输入更新游戏状态。在计算机回合时,程序会使用 Minimax 算法计算最优决策,并自动更新游戏状态。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值