---
title: "04-数组的左上半部分"
created: 2025-12-02
tags:
  - 项目
aliases:
  - 数组的左上半部分
---
# 数组的左上半部分

## 题目 [数组的左上半部分](https://www.acwing.com/problem/content/749/)

![[image-4badafe1.png]]

## 思路分析

左上角：i+j<11，符合我们就累加

## 代码实现

```java
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String op = sc.next();
        double[][] w = new double[12][12];
        for (int i = 0; i < 12; i ++ )
            for (int j = 0; j < 12; j ++ )
                w[i][j] = sc.nextDouble();

        double sum = 0, cnt = 0;
        for (int i = 0; i < 12; i ++ )
            for (int j = 0; j <= 10 - i; j ++ ) {
                sum += w[i][j];
                cnt += 1;
            }

        if (op.equals("M")) sum /= cnt;
        System.out.printf("%.1f\n", sum);
    }
}
```

## 同类题型

## 视频讲解

---

**项目分区导航**： [[03-数组替换|数组替换]] ⬅️ | 04-数组的左上半部分 |  ➡️ [[05-蛇形矩阵|蛇形矩阵]]