题解 | 简单题的求解

#include <iostream>

int main() {class Solution {
public:
    vector<int> multiply(const vector<int>& A) {
        vector<int> B;
        vector<int> front_product(A.size(),0);
        vector<int> back_product(A.size(),0);
        
        front_product[0] = A[0];
        for(int i = 1; i < A.size(); i++){
            front_product[i] = front_product[i-1] * A[i];
        }
        
        back_product[A.size() - 1] = A[A.size() - 1];
        for(int j = A.size() - 2; j >= 0; j--){
            back_product[j] = back_product[j+1] * A[j];
        }
        
        B.push_back(back_product[1]);
        for(int k = 1; k < A.size() - 1; k++){
            B.push_back(front_product[k-1] * back_product[k+1]);
        }
        B.push_back(front_product[A.size() - 2]);
        return B;
    }
};
    std::cout << "Hello World!";
    return 0;
}

class HelloWorld {
    public static void main(String[] args) {
        System.out.println("Hello, World!"); 
    }
}

print('Hello world!')