练习1:求和!
代码:
-module(myEx2).
-export([
sum/2
]).
sum(1) ->1;
sum(N) -> sum(N-1) +N.
sum(N,M) ->
if N =< M ->
sum(M) - sum(N) + N;
true ->
io:format("N > M ,return error!~n",[])
end.
练习2:创建列表。
代码:
create(N) -> create(N,[]).
create(0,L) -> L;
create(N,L) -> create(N-1,[N|L]).
reverse(L) -> reverse(L,[]).
reverse([],L) -> L;
reverse([H|T],L) -> reverse(T,[H|L]).
reverse_create(N) ->reverse(create(N)).
练习3:输出满足条件的数。
代码:
print(N) ->
io:format("numbers:"),
print(1,N).
print(First,N) ->
if First =< N ->
io:format("~p~n",[First]),
print(First+1,N);
true -> %%如果不加此处分支语句,Erlang 会抛出错误信息
ok %%exception error: no true branch found when evaluating an if expression in function 、myEx2:print/2
end.
print_even(N) ->
io:format("numbers:"),
print_even(1,N).
print_even(First,N) ->
if First =< N ->
if First rem 2 =:= 0 ->
io:format("~p~n",[First]);
true ->
go_on
end,
print_even(First+1,N);
true ->
ok
end.
练习4:汉诺塔。
代码:
hanoi(N) -> hanoi(N,a,b,c).
hanoi(1,_A,_B,_C) -> io:format("Move disk 1 from a to c. ~n");
hanoi(N,A,B,C) ->
hanoi(N-1,A,C,B),
io:format("Move disk ~p from ~p to ~p~n",[N,A,C]),
hanoi(N-1,B,C,A).
练习5:
求
1-2+3-4+5-6+...+n
。
element(1) -> 1;
element(N) ->
if N rem 2 =:= 0 ->
-N;
true ->
N
end.
add(1) -> 1;
add(N) -> element(N) + add(N-1).