zoukankan      html  css  js  c++  java
  • 170411、java Socket通信的简单例子(UDP)

    服务端代码:

    package com.bobohe.socket;
     
    import java.io.*;
    import java.net.*;
     
    class UDPServer {
        public static void main(String[] args) throws IOException {
            DatagramSocket server = new DatagramSocket(5050);
            byte[] recvBuf = new byte[100];
            DatagramPacket recvPacket = new DatagramPacket(recvBuf, recvBuf.length);
            server.receive(recvPacket);
            String recvStr = new String(recvPacket.getData(), 0,
                    recvPacket.getLength());
            System.out.println("Hello World!" + recvStr);
            int port = recvPacket.getPort();
            InetAddress addr = recvPacket.getAddress();
            String sendStr = "Hello ! I'm Server";
            byte[] sendBuf;
            sendBuf = sendStr.getBytes();
            DatagramPacket sendPacket = new DatagramPacket(sendBuf, sendBuf.length,
                    addr, port);
            server.send(sendPacket);
            server.close();
        }
    }

    客户端代码:

    package com.bobohe.socket;
     
    import java.io.*;
    import java.net.*;
    class UDPClient{
        public static void main(String[] args)throws IOException{
     
            DatagramSocket client = new DatagramSocket();
     
            String sendStr = "Hello! I'm Client";
            byte[] sendBuf;
            sendBuf = sendStr.getBytes();
            InetAddress addr = InetAddress.getByName("127.0.0.1");
            int port = 5050;
            DatagramPacket sendPacket = new DatagramPacket(sendBuf ,sendBuf.length , addr , port);
            //发送数据
            client.send(sendPacket);
            byte[] recvBuf = new byte[100];
            DatagramPacket recvPacket
                = new DatagramPacket(recvBuf , recvBuf.length);
            //接收数据
            client.receive(recvPacket);
            String recvStr = new String(recvPacket.getData() , 0 ,recvPacket.getLength());
            System.out.println("收到:" + recvStr);
            client.close();
        }
    }
  • 相关阅读:
    【AGC010E】Rearranging(博弈,图论,拓扑排序)
    【ARC074F】Lotus Leaves(最小割)
    【ARC069F】Flags(2-SAT,Tarjan,线段树优化建图)
    [CTS 2019] 氪金手游
    HDU
    LOJ
    LOJ
    [TJOI 2015] 概率论
    [AGC 018F] Two Trees
    LOJ
  • 原文地址:https://www.cnblogs.com/zrbfree/p/6715500.html
Copyright © 2011-2022 走看看