Erlang - How To Return Count/Number Of Elements

2019-07-19 06:41发布

This is my very first Erlang project. Basically, I have to write a function that takes a list of integers as a parameter & returns the number of integers from the list that are less than 1. What I have so far is a function that just returns how many integers in the list. I am not sure where/if I'm supposed to put a if statement and counter to only return how many integers are less than 1.

-export([num/1]).

num([]) -> 0 ;
num(L) -> num(L,0).

num([],Len) -> Len;
num([_|T],Len) ->
    num(T,Len+1).

标签: erlang
3条回答
贼婆χ
2楼-- · 2019-07-19 06:56

This one avoid to build an intermediate list. roughly the same than Anthony proposal using erlang library and anonymous function.

lists:foldl(fun(X,Count) when X < 1 -> Count+1; (_,Count) -> Count end,0,L).
查看更多
趁早两清
3楼-- · 2019-07-19 07:03

Your code is almost there. Key skill to learn: guard

-export([num/1]).

num([]) -> 0;
num(NUMS) ->
        num(NUMS, 0).

num([H|L], Count) when H < 1 ->  %% use of guard
        num(L, Count+1);
num([_|L], Count) ->
        num(L, Count);
num([], Count) ->
        Count.
查看更多
我命由我不由天
4楼-- · 2019-07-19 07:09

You can use length() to find the length of a list, and can use list comprehensions to filter your list.

num(L) -> length([X || X <- L, X < 1]).

Working example:

% list counter program
-module(listcounter).
-export([printnum/0, num/1]).

printnum() ->
    L = [1,2,3,0,0],
    io:fwrite("List size: ~p\n",[num(L)]).

num(L) ->
    length([X || X <- L, X < 1]).
查看更多
登录 后发表回答