/// <summary>
/// 有序递减数组中插入任意数使的新数组依旧有序,保持数组长度不变
/// </summary>
/// <param name="arr">有序递减</param>
/// <param name="insertNum"></param>
public void InsertNum(int [] arr,int insertNum)
{
for (int i = arr.Length - 1; i >= 0; i--)
{
if (arr[i] < insertNum)
{
if (i == 0)
{
arr[i] = insertNum;
break;
}
if (insertNum > arr[i - 1])
arr[i] = arr[i - 1];
else
{
arr[i] = insertNum;
break;
}
}
else break;
}
}
/// 有序递减数组中插入任意数使的新数组依旧有序,保持数组长度不变
/// </summary>
/// <param name="arr">有序递减</param>
/// <param name="insertNum"></param>
public void InsertNum(int [] arr,int insertNum)
{
for (int i = arr.Length - 1; i >= 0; i--)
{
if (arr[i] < insertNum)
{
if (i == 0)
{
arr[i] = insertNum;
break;
}
if (insertNum > arr[i - 1])
arr[i] = arr[i - 1];
else
{
arr[i] = insertNum;
break;
}
}
else break;
}
}