Write a java function to find minimum moves required for making 2 List equal. public int minimumOps(List S, List T){} The two possible moves are: shift(list) returns a new list after moving the front number to the back—i.e., [1, 2, 3 ,4 ] -----> [2, 3, 4, 1] reverse(list) returns the reverse of the list—i.e., [1, 2, 3, 4] -------> [4, 3, 2, 1] for example: consider S = {1, 2, 3, 4} and T = {2, 1, 4, 3}, we can see that T = shift ( shift( reverse( S ))) S = [1, 2 , 3 ,4] -----> [4, 3, 2, 1] ------>[3, 2, 1, 4] -------->[2, 1, 4, 3] = T = 3 moves total. But this is not the only way to transform S to T. To illustrate, here are some other sequence of operations : T = reverse(shift(shift(S))) T = shift(reverse(shift(S))) T = reverse(shift(shift(reverse(reverse(S)))))) Goal is to find the minimum moves on S list to form T list. Some more input/ output examples of length 5 minimumOps(List.of(1,2,3,4,5), List.of(2,1,5,4,3)) == 3 minimumOps(List.of(5,4,3,2,1), List.of(1,5,4,3,2)) == 3 minimumOps(List.of(1,2,3,4,5), List.of(5,4,3,2,1)) == 1

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Write a java function to find minimum moves required for making 2 List<Integer> equal.

public int minimumOps(List<Integer> S, List<Integer> T){}

The two possible moves are:

  • shift(list) returns a new list after moving the front number to the back—i.e., [1, 2, 3 ,4 ] -----> [2, 3, 4, 1]

  • reverse(list) returns the reverse of the list—i.e., [1, 2, 3, 4] -------> [4, 3, 2, 1]

for example: consider S = {1, 2, 3, 4} and T = {2, 1, 4, 3},

we can see that T = shift ( shift( reverse( S )))

S = [1, 2 , 3 ,4] -----> [4, 3, 2, 1] ------>[3, 2, 1, 4] -------->[2, 1, 4, 3] = T

= 3 moves total.

  • But this is not the only way to transform S to T.

    To illustrate, here are some other sequence of operations :

    T = reverse(shift(shift(S)))

  • T = shift(reverse(shift(S)))

  • T = reverse(shift(shift(reverse(reverse(S))))))

Goal is to find the minimum moves on S list to form T list.

  • Some more input/ output examples of length 5

  • minimumOps(List.of(1,2,3,4,5), List.of(2,1,5,4,3)) == 3
  • minimumOps(List.of(5,4,3,2,1), List.of(1,5,4,3,2)) == 3
  • minimumOps(List.of(1,2,3,4,5), List.of(5,4,3,2,1)) == 1
Expert Solution
steps

Step by step

Solved in 3 steps with 5 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY