Given a vector v, return a vector s containting the sum of every two adjacent elements in the vector.
Every element s(i) contains the sum of v(i) and v(i+1).
Example:
v = [1, 2, 4, 4, 5, 8] s = [3, 6, 8, 9, 13]
Solution Stats
Solution Comments
-
2 Comments
Shaul Salomon
on 3 Dec 2017
sorry mate, this is unfair for those who actually came up with a compact solution
Samuele Grillo
on 12 Dec 2017
No need to be sorry.
Personally I think the regexp should be always forbidden.
I used it (and I had never thought about it before) because it seems that everyone is using it.
Recent Solvers243
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
2287 Solvers
-
Swap the first and last columns
9253 Solvers
-
269 Solvers
-
07 - Common functions and indexing 2
250 Solvers
-
134 Solvers
More from this Author25
Tags
Select a Web Site
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: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 1799547
why this code is not correct?
s = summ(v)
>> b=s
>> s(1)=[]
>> c=[[s],0]
>> s=[b+c]
>> s(end)=[]