Как найти индексы элемента двумерного массива

Right now, you should consistently get 2 * arr.length as the final value. That isn’t what you are probably looking for. It looks like you want to know the coordinates for the max value. To do this, you’ll need to cache the values of the indexes and then use them later:

public static void main(String[] args) {
    int[][] arr = {{4, 44, 5, 7, 63, 1}, {7, 88, 31, 95, 9, 6}, {88, 99, 6, 5, 77, 4}};
    int tmpI = 0;
    int tmpJ = 0;
    double max = arr[0][0];
    // there are some changes here. in addition to the caching
    for (int i = 0; i < arr.length; i++) {
        int[] inner = arr[i];
        // caches inner variable so that it does not have to be looked up
        // as often, and it also tests based on the inner loop's length in
        // case the inner loop has a different length from the outer loop.
        for (int j = 0; j < inner.length; j++) {
            if (inner[j] > max) {
                max = inner[j];
                // store the coordinates of max
                tmpI = i; tmpJ = j;
            }
        }
    }
    System.out.println(max);
    // convert to string before outputting:
    System.out.println("The (x,y) is: ("+tmpI+","+tmpJ+")");

answered Sep 23, 2011 at 22:48

Costis AivalisCostis Aivalis

13.7k3 gold badges46 silver badges47 bronze badges

JoeJoe

80.3k18 gold badges127 silver badges145 bronze badges

Bhesh GurungBhesh Gurung

50.3k22 gold badges93 silver badges141 bronze badges

answered Sep 23, 2011 at 22:47

//C++ code
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> b;
vector<int> c;
int Func(int a[][10],int n)
{
    int max;
    max=a[0][0];
    for(int i=0;i<n;i++)
    {
            for(int j=0;j<n;j++)
            {
                    if(a[i][j]>max)
                    {
                                   max=a[i][j];
                                   b.push_back(i);
                                   c.push_back(j);
                                   }

                    }
                    }
                    b.push_back(0);
                    c.push_back(0);
                    return max;
                    }
    void display(int a[][10],int n)
    {
         for(int i=0;i<n;i++)
    {
            for(int j=0;j<n;j++)
            {
                    cout<<a[i][j]<<"t";
                    }
                    cout<<endl;
                    }
                    }

int main()
{
    int a[10][10],n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
            for(int j=0;j<n;j++)
            {
                    cin>>a[i][j];
                    }
                    }
                    cout<<endl;
                    display(a,n);
                    cout<<endl;
                    cout<<Func(a,n)<<" is the greatest "<<endl;
                    if(b.size()==1&&c.size()==1)
                    {
                                            cout<<"Location is (1,1)"<<endl;
                                            }
                                            else
                                            {
                                                 b.erase(b.end() - 1);
                                                 c.erase(c.end() - 1);
                    cout<<"Location is "<<"("<<b.back()+1<<","<<c.back()+1<<")"<<endl;
                    }
                    return 0;
                    }

answered Nov 7, 2012 at 19:26

abdolenceabdolence

2,3341 gold badge21 silver badges29 bronze badges