0/1 Knapsack problem using Iterative Approach, C#

Language: Layout:

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Item 
    {
        public int value;
        public int weight;
    }
    
    public class Program
    {
        public static void Main(string[] args)
        {
            var items = new[]
            {
                new Item {value = 10, weight = 1},
                new Item {value = 20, weight = 1},
                new Item {value = 30, weight = 1},
                new Item {value = 50, weight = 1},
                new Item {value = 70, weight = 1},
            };

Console.WriteLine(Knapsack(items, 2));
        }
        
        static int Knapsack (Item[] items, int capacity)
        {
            var t = new int[items.Length+1, capacity+1];

for (int itemIndex=0; itemIndex <= items.Length; itemIndex++)
            {
                var currentItem = itemIndex == 0 ? null : items[itemIndex - 1];
                for (int currentCapacity = 0; currentCapacity <= capacity; currentCapacity++)
                {
                    if (currentItem == null || currentCapacity == 0)
                        t[itemIndex, currentCapacity] = 0;
                    
                    else if (currentItem.weight <= currentCapacity)
                    {
                        t[itemIndex, currentCapacity] = Math.Max (currentItem.value + t[itemIndex-1, currentCapacity-currentItem.weight], 
                                                                  t[itemIndex-1, currentCapacity]);
                    }
                    
                    else
                    {
                        t[itemIndex, currentCapacity] = t[itemIndex-1, currentCapacity];
                    }
                    Console.WriteLine($"currentItem={currentItem?.value} \t currentCapacity= {currentCapacity}");
                    printMatrix (t, items.Length, capacity);
                }
            }
            
            return t[items.Length, capacity];
        }
        
        private static void printMatrix (int[,] mat, int n, int capacity)
        {
            Console.WriteLine("----------------------------------------------------------------------------------");
            for (int itemIndex=0; itemIndex <= n; itemIndex++)
            {
                for (int currentCapacity = 0; currentCapacity <= capacity; currentCapacity++)
                {
                    Console.Write(mat[itemIndex, currentCapacity] + "\t");
                }
                
                Console.WriteLine("");
            }
            Console.WriteLine("----------------------------------------------------------------------------------\n");
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0.62 sec, absolute running time: 0.22 sec, cpu time: 0.13 sec, memory peak: 38 Mb, absolute service time: 0,99 sec