解答程式

using System;

namespace ccc.container
{
    class Program
    {
        static void Main(string[] args)
        {
            double pi = 3.14159;
            double e = 2.71828;

            Array a1 = new Array(10);
            a1.append(pi);
            a1.append(e);

            Stack s1 = new Stack(10);
            s1.push(pi);
            s1.push(e);
            double x = s1.pop();
            Console.WriteLine("x=" + x);

            double[] a = new double[] { 1.0, 2.0, 3.0 };
            double[] b = new double[] { 3.0, 2.0, 1.0 };
            Vector v1 = new Vector(a);
            Vector v2 = new Vector(b);
            v1.add(v2);
            v1.sub(v2);
            v1.neg();
            Console.WriteLine("v1.inner(v2)=" + v1.inner(v2));
        }
    }

    class Array
    {
        public double[] a;
        public int count = 0;

        public Array(int size)
        {
            a = new double[size];
        }

        public Array(double[] pa)
        {
            a = new double[pa.Length];
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = pa[i];
            }
        }

        public void append(double t) {
            a[count] = t;
            count++;
        }
    }

    class Stack : Array
    {
        public Stack(int size) : base(size)
        {
        }

        public void push(double t)
        {
            append(t);
        }

        public double pop()
        {
            count--;
            return a[count];
        }
    }

    class Vector : Array
    {
        public Vector(double[] pa) : base(pa)
        {
        }

        public void add(Vector v2)
        {
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = a[i] + v2.a[i];
            }
        }

        public void neg()
        {
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = -1*a[i];
            }
        }

        public void sub(Vector v2)
        {
            for (int i = 0; i < a.Length; i++)
            {
                a[i] = a[i] - v2.a[i];
            }
        }

        public double inner(Vector v2)
        {
            double result = 0.0;
            for (int i = 0; i < a.Length; i++)
            {
                result += a[i] * v2.a[i];
            }
            return result;
        }
    }
}

page revision: 7, last edited: 13 Nov 2019 01:15

Edit Tags Discuss (0) History Files Print Site tools + Options

作者：陳鍾誠

解答程式

Post preview:

Other interesting sites