mirror of
https://github.com/kmc7468/cs220.git
synced 2025-12-12 21:08:45 +00:00
Update assignment 09
This commit is contained in:
@@ -7,6 +7,8 @@
|
||||
|
||||
use std::collections::HashMap;
|
||||
|
||||
use itertools::*;
|
||||
|
||||
/// Returns whether the given sequence is a fibonacci sequence starts from the given sequence's first two terms.
|
||||
///
|
||||
/// Returns `true` if the length of sequence is less or equal than 2.
|
||||
@@ -35,6 +37,8 @@ pub fn sigma<T, F: Fn(T) -> i64>(inner: impl Iterator<Item = T>, f: F) -> i64 {
|
||||
|
||||
/// Alternate elements from three iterators until they have run out.
|
||||
///
|
||||
/// You can assume that the number of elements of three iterators are same.
|
||||
///
|
||||
/// # Example
|
||||
///
|
||||
/// ```
|
||||
|
||||
@@ -2,8 +2,9 @@
|
||||
|
||||
#![allow(dead_code)]
|
||||
#![allow(unused_mut)]
|
||||
#![allow(unreachable_code)]
|
||||
#![allow(unused_imports)]
|
||||
#![allow(unused_variables)]
|
||||
#![allow(unreachable_code)]
|
||||
|
||||
pub mod assignment01;
|
||||
mod assignment01_grade;
|
||||
|
||||
Reference in New Issue
Block a user