如何創建一個在Java中生成隨機值的方法？

Question

我有二進制搜索樹代碼（它是硬代碼）做（插入，刪除，最大值，最小值，排序和查找），我想爲BST學習效率。我想要創建一個隨機方法來生成1000個數字，而不是輸入數字。 如何創建此方法？

public class BinarySearchTree { 


private Node root; 

    private static class Node { 
     Node parent; 
     Node left; 
     Node right; 
     int data; 

     Node(int data) { 
      this.data = data; 
     } 

     @Override 
     public String toString() { 
      return "" + data; 
     } 
    } 


    public void insert(int data) { 
     root = insert(root, data); 
    } 

    public Node insert(Node node, int data) { 
     if(node == null) { 
      node = new Node(data); 
     } else if(data < node.data) { 
      node.left = insert(node.left, data); 
      node.left.parent = node; 
     } else { 
      node.right = insert(node.right, data); 
      node.right.parent = node; 
     } 
     return node; 
    } 

    private void swap(Node a, Node b) { 

     if(a.parent == null) { 
      root = b; 
     } else if(a == a.parent.left) { 
      a.parent.left = b; 
     } else { 
      a.parent.right = b; 
     } 

     if(b != null) { 
      b.parent = a.parent; 
     } 
    } 

    public void delete(int data) { 
     delete(root, data); 
    } 

    public void delete(Node node, int data) { 

     if(node == null) { 
      return; 
     } 
     else if (data == node.data) { 
      if(node.left == null) { 
       swap(node, node.right); 
      } 
      else if(node.right == null) { 
       swap(node, node.left); 
      } 
      else { 
       Node minNode = node.right; 
       while(minNode.left != null) { 
        minNode = minNode.left; 
       } 
       if(minNode.parent != node) { 
        swap(minNode, minNode.right); 
        minNode.right = node.right; 
        minNode.right.parent = minNode; 
       } 

       swap(node, minNode); 
       minNode.left = node.left; 
       minNode.left.parent = minNode; 
      } 
     } 
     // Continue searching in the left subtree. 
     else if(data < node.data) { 
      delete(node.left, data); 
     } 
     // Continue searching in the right subtree. 
     else { 
      delete(node.right, data); 
     } 
    } 

    public boolean lookup(int data) { 
     return lookup(root, data); 
    } 

    public boolean lookup(Node node, int data) { 
     if(node == null) { 
      // Can't find it. 
      return false; 
     } else if(data == node.data) { 
      // Found it. 
      return true; 
     } else if(data < node.data) { 
      // Search left subtree. 
      return lookup(node.left, data); 
     } else { 
      // Search right subtree. 
      return lookup(node.right, data); 
     } 
    } 

    public int minValue() { 
     return minValue(root); 
    } 

    public int minValue(Node node) { 
     Node cursor = node; 
     while(cursor.left != null) { 
      cursor = cursor.left; 
     } 
     return cursor.data; 
    } 

    public int maxValue() { 
     return maxValue(root); 
    } 

    public int maxValue(Node node) { 
     Node cursor = node; 
     while(cursor.right != null) { 
      cursor = cursor.right; 
     } 
     return cursor.data; 
    } 

    public void inorderTraversal() { 
     inorderTraversal(root); 
    } 

    private void inorderTraversal(Node node) { 
     if(node != null) { 
      inorderTraversal(node.left); 
      System.out.print(node.data + " "); 
      inorderTraversal(node.right); 
     } 
    } 

    public static void main(String[ ] args) { 
     BinarySearchTree bst = new BinarySearchTree(); 
     int[ ] input = new int[ ] { 5, 10, 3, 9, 7, 8 , 1 , 4 , 6 , 10}; 

     for(int i : input) { 
      bst.insert(i); 
     } 

     bst.delete(5); 
     bst.delete(10); 
     bst.delete(3); 
     bst.delete(7); 

     System.out.println("\n Sorted :"); 
     bst.inorderTraversal(); 

     System.out.println("\nMax Value:"); 
     System.out.println(bst.maxValue()); 
     System.out.println("\n Min Value:"); 
     System.out.println(bst.minValue()); 

     System.out.println(bst.lookup(1)); 
    } 
} 

Answer 1

這會給你MIN和MAX 1000個之間的隨機整數，包括MIN但不包括MAX。

int MIN; 
int MAX; 
int[] randoms = new int[1000]; 
Random randGen = new Random(); 

for(int i = 0; i < randoms.length; i++) 
{ 
    randoms[i] = MIN + randGen.nextInt(MAX - MIN)); 
} 

Answer 2

您可能會感興趣的java.util.Random：

import java.util.Random; 
... 
Random random = new Random(System.currentTimeMillis()); 
random.nextInt(); 

注意Random只創建僞隨機數，所以你必須使用足夠獨特的種子。

Answer 3

我第二個java.util.Random建議。你真的想存儲它們的一個數組還是你想要隨機發生器的隨機數在0和999之間，1000次？這裏有一個函數來獲取它們的數組，但我只是放棄數組並循環遍歷Random 1000次。

public static int[] generateRandomNumbers(int size) { 
    if (size <= 0) { 
     throw new IllegalArgumentException("size must be greater than 0"); 
    } 
    Random random = new Random(System.currentTimeMillis()); 
    int[] results = new int[ size ]; 
    for (int i = 0; i < size; i++) { 
     results[ i ] = random.nextInt(size); 
    } 
    return results; 
} 

......其他所有事情都是平等的，讓你的主人這樣，你有一個工作程序。我不知道這是否正確，它的工作原理...

public static void main(String[] args) { 
    BinarySearchTree bst = new BinarySearchTree(); 
    int[] randoms = generateRandomNumbers(1000); 
    for (int i : randoms) { 
     bst.insert(i); 
    } 

    bst.delete(randoms[ 5 ]); 
    bst.delete(randoms[ 10 ]); 
    bst.delete(randoms[ 3 ]); 
    bst.delete(randoms[ 7 ]); 

    System.out.println("\n Sorted :"); 
    bst.inorderTraversal(); 

    System.out.println("\nMax Value:"); 
    System.out.println(bst.maxValue()); 
    System.out.println("\n Min Value:"); 
    System.out.println(bst.minValue()); 

    System.out.println(bst.lookup(randoms[ 1 ])); 
    System.out.println(bst.lookup(randoms[ 999 ])); 
}