zoukankan      html  css  js  c++  java
  • 第六次作业

    import java.awt.BorderLayout;
    import java.awt.ScrollPane;
    import java.awt.event.ActionEvent;
    import java.awt.event.ActionListener;
    import java.util.HashSet;
    import java.util.Random;
    import javax.swing.JButton;
    import javax.swing.JFrame;
    import javax.swing.JLabel;
    import javax.swing.JPanel;
    import javax.swing.JTextArea;
     public class cj extends JFrame{
     public cj(){
     this.setTitle("抽奖系统");
     this.setSize(250, 180);
     this.setResizable(false);
     this.setLocationRelativeTo(this);
     this.setDefaultCloseOperation(EXIT_ON_CLOSE);
     this.setContentPane(createContentPanel());
     }
     private JPanel createCeterPanel(){
         JPanel panel=new JPanel();
         panel.add(new JLabel("点击抽奖"),JLabel.CENTER);
         JButton start=new JButton("开始");
         panel.add(start);
         ScrollPane sp = new ScrollPane(ScrollPane.SCROLLBARS_AS_NEEDED);
         final JTextArea area = new JTextArea();
         sp.add(area);
         panel.add(sp,BorderLayout.SOUTH);
         start.addActionListener(new ActionListener() {
           
            @Override
            public void actionPerformed(ActionEvent arg0) {
                // TODO Auto-generated method stub
                Random random = new Random();
                 Object[] values = new Object[6];
                 HashSet<Integer> hashSet = new HashSet<Integer>();
                   for(int i = 0;i < values.length;i++){
                       int number = random.nextInt(1000) + 1;
                       hashSet.add(number);
                   }
                  
                   values = hashSet.toArray();
                   area.append("一等奖号码为:"+values[0] + " ");
                   area.append("二等奖号码为:"+values[1]+" " +values[2]+" ");
                   area.append("二等奖号码为:"+values[3]+" "+values[4]+" "+values[5]+" ");
            }
       });
         return panel;
         }
     private JPanel createContentPanel(){
     JPanel panel=new JPanel(new BorderLayout());
     panel.add(BorderLayout.CENTER,createCeterPanel());
     return panel;
     }
    public static void main(String[] args) {
        new cj().setVisible(true);
    }

    }

  • 相关阅读:
    107. Binary Tree Level Order Traversal II
    103. Binary Tree Zigzag Level Order Traversal
    102. Binary Tree Level Order Traversal
    690. Employee Importance
    1723. Find Minimum Time to Finish All Jobs
    LeetCode 329 矩阵中最长增长路径
    7.2 物理内存管理
    LeetCode 面试题 特定深度节点链表
    LeetCode 100 相同的树
    npm安装包命令详解,dependencies与devDependencies实际区别
  • 原文地址:https://www.cnblogs.com/baixue/p/5470886.html
Copyright © 2011-2022 走看看