Given a vector, v, of real numbers, return a positive integer, n, representing the longest contiguous increasing sub-sequence contained in v.
v = [2 18 9 6 11 20 25 3]
n = 4
Learned from Solution 883700, by Tim. run this just for checking: I reckon that function "sum" in that solution is redundant, and my guessing seems to be right.
Quick response! Seems 0 is better than infinity...
lol~ yes, in terms of code size, 0 is better than Inf :-)
Find the longest sequence of 1's in a binary sequence.
Set the array elements whose value is 13 to 0
Reverse the elements of an array
Optimally fill a container with elements of different sizes
Regular polygon bounded by and bounding a circle
Segmented number sequence
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office