洋葱数组矩阵【难度:2级】:
答案1:
public class Kata
{
public static bool IsOnionArray(int[] arr)
{
for (int i = 0; i < arr.Length / 2; ++i)
{
if (arr[i] + arr[arr.Length - 1 - i] > 10) {
return false; }
}
return true;
}
}
答案2:
public class Kata
{
public static bool IsOnionArray(int[] a)
{
for (int i = 0; i < a.Length; i++) if (a[i] + a[a.Length - 1 - i] > 10 && i != a.Length - 1 - i) return false;
return true;
}
}
答案3:
using System;
public class Kata
{
public st