首页 > 其他 > 详细

模拟n步一维随机游走的情况。

时间:2014-03-23 10:17:37      阅读:500      评论:0      收藏:0      [点我收藏+]
bubuko.com,布布扣
package randomWalk;

import java.util.Random;
import java.util.Scanner;

public class RandomWalk {

    
    public static void main(String[] args) {
        
        
        Scanner console = new Scanner(System.in); 
        System.out.print("intput the steps you want to walk:");
        int steps =console.nextInt();
        randomWalk(steps);
        
        
    }
    public static void randomWalk(int steps)
    {
        System.out.println("walking " + steps + " steps" );
        
        Random r =new Random();
        
        int position =0,max = position;
        int direction = 0;
        for(int i = 0;i< steps;i++)
        {
           direction = r.nextInt(2);
           if(direction == 1)
              position += 1;
           else
              position -= 1;
           if(position > max)
                max = position;
           System.out.println("position = " + position);
        }
        System.out.println("max postion = " + max);
    }
}
bubuko.com,布布扣

结果类似于:

intput the steps you want to walk:7
walking 7 steps
position = 1
position = 0
position = -1
position = -2
position = -3
position = -2
position = -1
max postion = 1

模拟n步一维随机游走的情况。,布布扣,bubuko.com

模拟n步一维随机游走的情况。

原文:http://www.cnblogs.com/diligentcalf/p/3615626.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!