逆序数组之和

最新推荐文章于 2023-07-06 17:22:57 发布

Object_user

最新推荐文章于 2023-07-06 17:22:57 发布

阅读量215

点赞数 1

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_60571662/article/details/125657435

版权

算法专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#region 逆序数组之和
private int MathPow(int num)
{
int a = 1;
int Powers = 0;
for (int i = 0; i <=num; i++)
{
Powers = a;
a = a * 10;
}
return Powers;
}
public int[] ReverseArraySum(int [] arr1,int [] arr2)
{
int sum1 = 0;//第一个数组之和
int sum2 = 0;//第二个数组之和
int sums = 0;//两个数组之和
for (int i = arr1.Length-1; i >=0; i--)
{
int Powers = Convert.ToInt32( MathPow(i));
sum1 += arr1[i] * Powers;

}
for (int i = arr2.Length - 1; i >= 0; i--)
{
int Powers = Convert.ToInt32(MathPow(i));
sum2 += arr2[i] * Powers;

}
sums = sum1 + sum2;
int length = sums.ToString().Length;
int[] arr = new int[length];
for (int i = length - 1; i >=0; i--)
{
int Powers = Convert.ToInt32(MathPow(i));
arr[i] = sums / Powers % 10;
}
return arr;
}
#endregion