对角线差(Diagonal Difference)
来源:互联网 发布:3d编程基础 编辑:程序博客网 时间:2024/04/29 17:59
题目:
给出一个N*N的二维整数数组,计算主对角线元素和和副对角线和之间的差。
Sample Input
311 2 44 5 610 8 -12
Sample Output
15
我的解答:
import java.io.*;import java.util.*;public class DiagonalDifference{public static void main(String[] args){//inputScanner scan = new Scanner(System.in);int N = scan.nextInt();scan.nextLine();int arr[][] = new int[N][N];for(int i = 0; i < N; i++){for(int j = 0; j < N;j++){arr[i][j] = scan.nextInt();}if(scan.hasNextLine()){ // 如果不写这一行就会scan.nextLine();}}//calculateint primaryDiagonal = 0;for(int i = 0 ; i < N; i++){primaryDiagonal += arr[i][i];}int secondaryDiagonal = 0;for(int i = 0; i < N; i++){secondaryDiagonal += arr[i][N - i - 1];}int result = primaryDiagonal - secondaryDiagonal;result = (result < 0) ? (-result) : result;System.out.println(result);scan.close();}}
0 0
- 对角线差(Diagonal Difference)
- 对角矩阵(diagonal matrix)
- hdu 4598 Difference(奇圈判定+差分约束)
- HDU 4568 Difference(差分约束 + 二分图)
- Hdu 4594 Difference(奇圈判断+差分约束)
- 387.The Smallest Difference-最小差(中等题)
- 387.The Smallest Difference-最小差(中等题)
- 对角矩阵的性质(diagonal matrix)
- 45.Maximum Subarray Difference-最大子数组差(中等题)
- HDU 4598 Difference 差分约束 + 判奇圈
- [LintCode] 最小差 The Smallest Difference
- 前向差分(forward difference)
- 时序差分学习(Temporal-Difference Learning)
- 对角线
- ZOJ Monthly, January 2014 E Diagonal (浙江大学月赛)
- Diagonal Traverse
- nxn矩阵求和(对角线)
- 差分约束系统(System Of Difference Constraints)
- 定位迭代器的中间位置
- RFC 3261 SIP(1-6)
- 66.[Leetcode]Plus One
- Python 类和实例
- Struts 2.0 拦截器原理解读
- 对角线差(Diagonal Difference)
- javaScript拾遗
- python 中文乱码问题
- c++ 创建用当前时间命名的文件夹
- Matlab Tricks(九)—— 矩阵行/列的增广(删除)
- java中CAS方法分析
- Android EventBus的使用
- 练习三1004humble number
- AJAX工作原理及其优缺点