倒序数组的算法(C# 版),代码如下:
#region 倒序数组 static void SwapNumArray() { //int[] items = new int[] { 31, -41, 59, 26, -53, 58, 97, -93, -23, 84 }; //int[] items = new int[] { 31, -41,59 }; int[] items = new int[] { 31, -41, 59, 26 ,53}; int middleIndex = 0; bool isDouble = true; if (items.Length % 2 == 0) { //偶数 middleIndex = items.Length / 2 - 1; } else { isDouble = false; middleIndex = items.Length / 2; } int loopCount = isDouble == true ? middleIndex : (middleIndex - 1); int temp = 0; for (int i = 0; i <= loopCount; i++) { //交换items[i]和items[items.Length -1 -i] temp = items[items.Length - 1 - i]; items[items.Length - 1 - i] = items[i]; items[i] = temp; } foreach (int item in items) { Console.Write(item + ","); } Console.ReadKey(); } #endregion
等待更新...