2009-09-16 44 views
1

我想生成一個像乘法表一樣的序列。因此,對於1一開始和10停止我正在尋找像如何生成乘法表序列?

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, // 1*1 - 1*10 
2, 4, 6, 8, 10, 12, 14, 16, 18, 20, // 2*1 - 2*10 
3, 6, 9, 12, ... // 3*1 - 3*10 

下面的順序是我在這跛腳開始,但我似乎無法弄清楚如何幹淨地增加Ĵ當停止已經到達,或者如何重置我回到開始。

let multable (start,stop) = 
    (start,start) 
    |> Seq.unfold(
     fun (i,j) -> 
     Some(i*j, (i+1, j))) 

let its = multable(1, 1) 

let first10 = Seq.take 10 its 
printf "%A" (Seq.to_list first10) 

這當然給我1,2,3,4,5,6,7,8,9,10

回答

3

使用序列表達:

let multable start stop = seq{ 
    for a = start to stop do 
     for b = start to stop do 
     yield a*b 
} 

輸出:

> multable 1 3 |> Seq.to_list;; 
val it : int list = [1; 2; 3; 2; 4; 6; 3; 6; 9] 

用這種方式來表示一個基本的二維結構是很奇怪的。爲什麼不序列的序列:

let multable2 start stop = seq { 
    for a = start to stop do yield seq { 
     for b = start to stop do 
     yield a*b 
    } 
} 

輸出:

val multable2 : int -> int -> seq<seq<int>> 

> multable2 1 3 |> Seq.to_list;; 
val it : seq<int> list = [seq [1; 2; 3]; seq [2; 4; 6]; seq [3; 6; 9]] 

如果你想成爲 「聰明」,避免乘法:

let multable4 start stop = seq { 
    for a = start to stop do yield seq { 
     let s = ref 0 in 
     for b = start to stop do 
     s:=!s+a 
     yield !s 
    } 
} 

我實際上沒有看到任何漂亮預包裝「從序列b」的內涵/序列的表達之外,雖然有顯然[a..b](列表)和[| a..b |](數組),你可以通過Seq.unfold,SEQ項目。地圖等來製作一個Seq。

+0

謝謝,我結束了第一個構造。我希望能夠過濾所有這些數字的序列。可能會過濾這些序列的第二個「維度」,但這對我來說似乎更容易。 – esac

3

我真的不能相信的很多情況下,我寧願Seq.unfold在同等列表理解:

> let multiplication n m = [for a in 1 .. n -> [for b in 1 .. m -> a * b ] ];; 

val multiplication : int -> int -> int list list 

> multiplication 5 5;; 
val it : int list list = 
    [[1; 2; 3; 4; 5]; [2; 4; 6; 8; 10]; [3; 6; 9; 12; 15]; [4; 8; 12; 16; 20]; 
    [5; 10; 15; 20; 25]] 

偶爾Array.init方法也很管用:

> let multiplication n m = Array2D.init n m (fun n m -> n * m);; 

val multiplication : int -> int -> int [,] 

> multiplication 5 5;; 
val it : int [,] = [[0; 0; 0; 0; 0] 
        [0; 1; 2; 3; 4] 
        [0; 2; 4; 6; 8] 
        [0; 3; 6; 9; 12] 
        [0; 4; 8; 12; 16]] 
1
let Table r c = 
    [for row in 1..r do 
     yield [for col in 1..c do 
        yield row * col]] 
printfn "%A" (Table 5 4)      
// [[1; 2; 3; 4]; [2; 4; 6; 8]; [3; 6; 9; 12]; [4; 8; 12; 16]; [5; 10; 15; 20]] 
0

下面是使用序列的另一種方式:

let rec fromXToY x y = 
    seq { 
    if x <= y 
    then yield x; yield! fromXToY (x + 1) y; 
    else() 
    } 

let scaledSequence factor items = 
    Seq.map (fun x -> factor * x) items 

let mulTable x y = 
    let sequenceOfIntegersMultipliedByValue = (fun n -> scaledSequence n (fromXToY x y)) 
    let seqOfSeqOfValues = Seq.map sequenceOfIntegersMultipliedByValue (fromXToY x y) 
    // Convert the sequence of sequences to a simple sequence of values 
    Seq.fold Seq.append Seq.empty seqOfSeqOfValues