1 def longest IncreasingSubsequence (s: List [Int]): List[Int] { 2 val ns. length. 3 val dp= Array, fill (n) (1) 4 5 6 7 8 9 11 12 13 17 18 var maxLength dp. maxi 14 var subsequence List [Int] ( 15 var index n-1 16 19 2. ខ គ ន ព គ ឌ ន 20 21 22 23 24 25 for (i < 1 until n) ( for (<-0 until i) { 26) if (s(j) = 0) { if (dp(index)=maxLength) { subsequences(index) :: subsequence maxLength 1 ) 1 index 1 subsequence Main.scala:1: error: expected class or object definition def longestincreasingSubsequence(s: List[Int]): List[Int] = { A 1 error

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

May I ask what is wrong with line 1 of my code? How to correct it? Thanks

 

Main.scala:1: error: expected class or object definition
def longestIncreasingSubsequence(s: List[Int]): List[Int] = {
^
1 error

1 def longest IncreasingSubsequence (s: List [Int]): List[Int]
2 val ns. length
3 val dp = Array.fill (n) (1)
4
for (i < 1 until n) {
for (j-0 until i) {
if (s(j) s(i)) {
dp (i) = math. max (dp (i), dp (j) + 1)
8
9
10
11
12
13 var maxLength = dp. max
14 var subsequence = List[Int] ()
15 var index = n − 1
16
}
17 while (subsequence. length < maxLength && index >= 0) {
18
if (dp (index) == maxLength) {
19
subsequence = s(index) :: subsequence
20
maxLength -= 1
21
22
23 }
24
25 subsequence
26}
index 1
=
{
Main.scala:1: error: expected class or object definition
def longestIncreasing Subsequence(s: List[Int]): List[Int] = {
A
1 error
Fr
Transcribed Image Text:1 def longest IncreasingSubsequence (s: List [Int]): List[Int] 2 val ns. length 3 val dp = Array.fill (n) (1) 4 for (i < 1 until n) { for (j-0 until i) { if (s(j) s(i)) { dp (i) = math. max (dp (i), dp (j) + 1) 8 9 10 11 12 13 var maxLength = dp. max 14 var subsequence = List[Int] () 15 var index = n − 1 16 } 17 while (subsequence. length < maxLength && index >= 0) { 18 if (dp (index) == maxLength) { 19 subsequence = s(index) :: subsequence 20 maxLength -= 1 21 22 23 } 24 25 subsequence 26} index 1 = { Main.scala:1: error: expected class or object definition def longestIncreasing Subsequence(s: List[Int]): List[Int] = { A 1 error Fr
Expert Solution
steps

Step by step

Solved in 4 steps with 3 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