整数的F#列表中的已排序子列表

let rec findSortedSublists (lst: int list) : int list list =
    match lst with
    | [] -> [] // 空列表，返回空列表
    | [x] -> [[x]] // 只有一个元素的列表，返回包含该元素的子列表
    | x::y::xs ->
        if x <= y then
            let (sublist, rest) = takeWhile (fun a b -> a <= b) (x::y::xs)
            sublist :: findSortedSublists rest
        else
            findSortedSublists (y::xs)

let rec takeWhile (predicate: 'a -> 'a -> bool) (lst: 'a list) : 'a list * 'a list =
    match lst with
    | [] -> ([], []) // 空列表，返回空列表
    | [x] -> ([x], []) // 只有一个元素的列表，返回包含该元素的子列表和空列表
    | x::y::xs ->
        if predicate x y then
            let (sublist, rest) = takeWhile predicate (y::xs)
            (x::sublist, rest)
        else
            ([x], y::xs)

// 示例用法
let lst = [1; 2; 3; 5; 4; 6; 7; 9; 8]
let sortedSublists = findSortedSublists lst
printfn "%A" sortedSublists