Question

这是我的子类RECORD的代码的开头。

类记录{

private int shares;
private int pricePerShare;

// constructor
Record(int sharesNewValue, int pricePerShareNewValue) {
    shares = sharesNewValue;
    pricePerShare = pricePerShareNewValue;
}

// inspectors
public int getShares() {
    return shares;
}

public int getPricePerShare() {
    return pricePerShare;
}

// modifiers
public void setShares(int sharesNewValue) {
    shares = sharesNewValue;
}

public void setPricePerShare(int pricePerShareNewValue) {
    pricePerShare = pricePerShareNewValue;
}
}

我想在我的main方法中访问另一个类中的共享值。我将RECORD类链接到另一个名为QUEUE的子类。在我的主要方法中，我有一个指向QUEUE的链接：

 class Lab04a {
                 public static Queue Q = new Queue(); 
              }

稍后在代码中，我需要从Record类中的SHARES变量中减去一个int值，但因为它是Record类型，我不知道如何做到这一点！

我不确定在解释这个问题时我是否足够清楚，如果您有任何进一步的问题，我将非常乐意回复。

谢谢。

由于我无法连贯地说明我在本实验作业中想要完成的任务，我将完整地发布我的其他两个课程：

 class Queue {

private int count; // number of elements in the queue
private int head; // index of head element, -1 if queue is empty
private int tail; // index of tail element, -1 if queue is empty
private int MAXSIZE = 1; // Physical size of the queue. DO NOT CHANGE!
private Record[] array; // circular array to store the elements of the queue

// constructor
Queue() {
    count = 0;
    head = -1;
    tail = -1;
    array = new Record[MAXSIZE];
}

// inspectors
public boolean empty() {
    // Returns true if the queue is empty. Otherwise returns false.
    return (count != 0);
}

public int size() {
    // Returns the number of elements in the queue
    return count;
}

public Record front(){
    // Returns the head element of the queue if the queue is not empty.
    // Otherwise returns a Record with its data parts set to -1.
    if (count == 0)
        return new Record(-1, -1);
    else
        return array[head];
}

public Record rear(){
    // Returns the tail element of the queue if the queue is not empty.
    // Otherwise returns a Record with its data parts set to -1.
    if (count ==0)
        return new Record(-1, -1);
    else
        return array[tail];

}

public String toString() {
    // Returns the elements of the queue
    String str = "< ";
    int h = head;
    for (int i = 0; i < count; i++){
        str += "(" + array[h].getShares() + ", " + array[h].getPricePerShare() + ") ";
        h = (h+1) % MAXSIZE;
    }
    str += ">";
    return str;
}

// modifiers
public boolean dequeue() {
    // Removes the head element of the queue. 
    if (count == 0)
        return false;
    if (count == 1) {
        count = 0;
        head = -1;
        tail = -1;
    } 
    if (count > 1){
        head = (head + 1) % MAXSIZE;
        count--;
    }
    return true;
}

public void enqueue(Record element) {
    // Enqueues element to the tail of the queue.
    //if max size is reached, it doubles the size to allow for more values
    if (count == MAXSIZE) {
        Record[] array2 = new Record[MAXSIZE * 2];
        for (int i = 0; i < count; i++) {
            array2[i] = array[i];
        }//closes for loop
        array = array2;
        MAXSIZE *= 2;
    }
    tail = (tail + 1) % MAXSIZE;
    array[tail] = element;
    if (count == 0)
        head = tail;
    count++;
}//close enqueue method

} //关闭课程

然后这是我的主要父类：

 class Lab04a {
public static Queue Q = new Queue(); // creates global object
public static Record R = Record;

public static void main(String args[]) {

    Scanner scan = new Scanner(System.in);

    int option, buyPrice, buyShares, sellPrice, sellShares, totalShares, totalValues, totalSellPrice;
    option = 0;
    totalShares = 0;
    totalValues = 0;
    Queue Q2 = Q;

    while (option != 3) {
        System.out.print("Enter option (1:buy, 2:sell, 3:quit): ");
        option = scan.nextInt();
        if (option == 1) {
            System.out.print("Enter shares to buy and price per share: ");
            buyShares = scan.nextInt();
            buyPrice = scan.nextInt();
            Record r = new Record(buyShares, buyPrice);
            Q.enqueue(r);
            totalShares = totalShares + buyShares;
            totalValues = totalValues + (buyShares * buyPrice);

        }// ends if



        if (option == 2) {
            System.out.print("Enter shares to sell and price per share: ");
            sellShares = scan.nextInt();
            sellPrice = scan.nextInt();
            totalSellPrice = sellPrice * sellShares;

            if (sellShares > totalShares) {
                System.out.println("You do not own enough shares for this sale.");
            }
            for (int i = sellShares; i > 0; ) {
                if (sellShares == Q.front().getShares()) {
                    i -= Q.front().getShares();
                    Q.dequeue();
                }
                if (sellShares < Q.front().getShares()){

                    Record minus; 
                    minus = Q.front() - sellShares;

                    Q.front().setShares(minus);

                    Q.front().setShares(Q.front().getShares());
                    i -= sellShares;
                }
            }


        }// ends if


        // Prints content of Queue
        System.out.println("Queue: " + Q.toString());

        System.out.println("Total Shares: " + totalShares);
        System.out.println("Total Shares Value: $" + totalValues);
        System.out.println();

    }// ends while loop
    System.out.println(Q.toString());
}// ends main method

}

Answer 1

如果我理解您的问题，您可以添加访问者和mutator方法（或获取者和设置者）

private int shares;
private int pricePerShare;
public int getShares() {
  return shares;
}
public void setShares(int shares) {
  this.shares = shares;
}
public int getPricePerShare() {
  return pricePerShare;
}
public void setPricePerShare(int pricePerShare) {
  this.pricePerShare = pricePerShare;
}

修改

要使用它，

Record record = Q.front(); // <-- I assume your Q contains Record(s). if (record.getShares() >= sellShares) { record.setShares(record.getShares() - sellShares); // <-- for example }

Answer 2

确保Q.front（）是一个返回记录的方法。

如果确实如此，您应该可以使用

行

Q.front().setShares(Q.front().getShares()-MINUS_VALUE))

我正在尝试从子类访问私有变量

2 个答案: