Not difficult. It is like why can not compare two strings. And how to compare one object which initialed as a string with string. The coding quesition is to find the kth in two sorted arrays.

Question

teo · Accepted Answer

Maybe I'd use a binary search on the two arrays... it's tricky, but the solution MUST be fast

Anónimo · Answer

First is to write a compareTo function. And the coding problem is simple.

Anónimo · Answer

public void FindKthLargestElement(int[] sorted1, int[] sorted2, int k)
        {
            int i = sorted1.Length - 1;
            int j = sorted2.Length - 1;
            int kth = -1;
            while (i >= 0 && j >= 0 && k > 0)
            {
                if (sorted1[i] > sorted2[j])
                {
                    kth = sorted1[i];
                    i--;
                }
                else
                {
                    kth = sorted2[j];
                    j--;
                }
                k--;
            }

            while (k > 0)
            {
                if (i  0)
            {
                if (sorted1[i]  0)
            {
                if (i > sorted1.Length - 1)
                {
                    kth = sorted2[j];
                    j++;
                    k--;
                } else if (j > sorted2.Length - 1)
                {
                    kth = sorted1[i];
                    i++;
                    k--;
                }
            }

            Console.WriteLine(kth);
        }

Batman · Answer

The above solution is m+n. The solution that gets you hired is log(m+n), but it doesn't involve binary search.

Batman · Answer

So the ideas is instead of just cut one number each time, you cut k / 2 numbers every time.

Google

Pregunta de entrevista de Google

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo