Przeglądaj źródła

Comment to not use any existing crates

Michael Mächtel 8 lat temu
rodzic
commit
5861484f27
2 zmienionych plików z 2 dodań i 2 usunięć
  1. 1
    1
      hw2/task1/README.md
  2. 1
    1
      hw2/task3/README.md

+ 1
- 1
hw2/task1/README.md Wyświetl plik

8
 
8
 
9
 Calculate the Hamming difference between two DNA strands by implementing the
9
 Calculate the Hamming difference between two DNA strands by implementing the
10
 library function *hamming_distance(s1: &str, s2: &str) -> Result<usize,
10
 library function *hamming_distance(s1: &str, s2: &str) -> Result<usize,
11
-String>*.
11
+String>*. Do not use any crates.
12
 
12
 
13
 A mutation is simply a mistake that occurs during the creation or copying of a
13
 A mutation is simply a mistake that occurs during the creation or copying of a
14
 nucleic acid, in particular DNA. Because nucleic acids are vital to cellular
14
 nucleic acid, in particular DNA. Because nucleic acids are vital to cellular

+ 1
- 1
hw2/task3/README.md Wyświetl plik

9
 Compute Pascal's triangle up to a given number of rows. Create the new type
9
 Compute Pascal's triangle up to a given number of rows. Create the new type
10
 *PascalsTriangle* and implement the methods *new()* and *rows()*. See the
10
 *PascalsTriangle* and implement the methods *new()* and *rows()*. See the
11
 `tests/task3.rs` for more informationen about parameters and returns of the
11
 `tests/task3.rs` for more informationen about parameters and returns of the
12
-methods.
12
+methods. Do not use any crates.
13
 
13
 
14
 In Pascal's Triangle each number is computed by adding the numbers to the right
14
 In Pascal's Triangle each number is computed by adding the numbers to the right
15
 and left of the current position in the previous row.
15
 and left of the current position in the previous row.

Ładowanie…
Anuluj
Zapisz