chapter 12 finished

senrust · senrust · commit d11de63d7afe · 2021-02-27T21:22:18.000+09:00
diff --git a/chapter_11/fibonacci/Cargo.lock b/chapter_11/fibonacci/Cargo.lock
diff --git a/chapter_11/fibonacci/Cargo.toml b/chapter_11/fibonacci/Cargo.toml
@@ -0,0 +1,9 @@
+[package]
+name = "fibonacci"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/chapter_11/fibonacci/src/main.rs b/chapter_11/fibonacci/src/main.rs
@@ -0,0 +1,9 @@
+fn main() {
+    let mut fibvec: Vec<i64> = Vec::new();
+    fibvec.push(0);
+    fibvec.push(1);
+    for i in 2..50 {
+        fibvec.push(fibvec[i - 1] + fibvec[i - 2]);
+    }
+    println!("40th value is {}", fibvec[40]);
+}
diff --git a/chapter_11/lcs/Cargo.toml b/chapter_11/lcs/Cargo.toml
@@ -0,0 +1,9 @@
+[package]
+name = "lcs"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/chapter_11/lcs/src/main.rs b/chapter_11/lcs/src/main.rs
@@ -0,0 +1,24 @@
+use std::io;
+use std::cmp::max;
+
+fn main() {
+    let mut input_line = String::new();
+    io::stdin().read_line(&mut input_line).unwrap();
+    let string_a = input_line.trim().parse::<String>().ok().unwrap();
+    input_line.clear();
+    io::stdin().read_line(&mut input_line).unwrap();
+    let string_b = input_line.trim().parse::<String>().ok().unwrap();
+    let mut lcs_vec: Vec<Vec<i32>> = vec![vec![0; string_b.chars().count()]; string_a.chars().count()]; 
+    let mut max_lcs = 0;
+    for i in 1..string_a.chars().count() {
+        for j in 1..string_b.chars().count() {
+            if string_a.chars().nth(i) == string_b.chars().nth(j) {
+                lcs_vec[i][j] = lcs_vec[i-1][j-1] + 1;
+            } else  {
+                lcs_vec[i][j] = max(lcs_vec[i - 1][j], lcs_vec[i][j -1]);
+            }
+            max_lcs = max(max_lcs, lcs_vec[i][j]);
+        }
+    }
+    println!("lcs is {}", max_lcs);
+}
diff --git a/chapter_11/matrix/Cargo.toml b/chapter_11/matrix/Cargo.toml
@@ -0,0 +1,9 @@
+[package]
+name = "matrix"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
diff --git a/chapter_11/matrix/src/main.rs b/chapter_11/matrix/src/main.rs
@@ -0,0 +1,3 @@
+fn main() {
+    println!("Hello, world!");
+}
diff --git a/chapter_12/graph/Cargo.lock b/chapter_12/graph/Cargo.lock
diff --git a/chapter_12/graph/Cargo.toml b/chapter_12/graph/Cargo.toml
@@ -0,0 +1,10 @@
+[package]
+name = "graph"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}
diff --git a/chapter_12/graph/input.txt b/chapter_12/graph/input.txt
@@ -0,0 +1,5 @@
+4
+1 2 2 4
+2 1 4
+3 0
+4 1 3
diff --git a/chapter_12/graph/src/main.rs b/chapter_12/graph/src/main.rs
@@ -0,0 +1,21 @@
+use std::usize;
+
+fn main() {
+    let nodesize: usize = input::read_number();
+    let mut graph_matrix: Vec<Vec<usize>> = vec![vec![0; nodesize]; nodesize];
+    for _ in 0..nodesize {
+        let node_info: Vec<usize> = input::read_numline();
+        let node_num = node_info[0] -1;
+        let adjacent_node_count =  node_info[1];
+        for i in 0..adjacent_node_count {
+            let adjacent_node_num = node_info[2+i] -1;
+            graph_matrix[node_num][adjacent_node_num] = 1;
+        }
+    }
+    for node in graph_matrix {
+        for isadjacent in node {
+            print!("{} ", isadjacent);
+        }
+        print!("\n")
+    }
+}
diff --git a/chapter_12/graph_breadth_search/Cargo.lock b/chapter_12/graph_breadth_search/Cargo.lock
diff --git a/chapter_12/graph_breadth_search/Cargo.toml b/chapter_12/graph_breadth_search/Cargo.toml
@@ -0,0 +1,10 @@
+[package]
+name = "graph_breadth_search"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}
diff --git a/chapter_12/graph_breadth_search/src/main.rs b/chapter_12/graph_breadth_search/src/main.rs
@@ -0,0 +1,42 @@
+use  std::collections::VecDeque;
+
+fn breadch_search(graph_matrix: &Vec<Vec<usize>>, distance_from_node0: &mut Vec<i32>) {
+    let mut breadth_queue: VecDeque<usize> = VecDeque::new();
+    breadth_queue.push_back(0);
+    distance_from_node0[0] = 0;
+
+    while !breadth_queue.is_empty() {
+        let node = breadth_queue.pop_front().unwrap();
+        let distance = distance_from_node0[node];
+        for ajucent_node in 0..distance_from_node0.len() {
+            if graph_matrix[node][ajucent_node] == 1 {
+                if distance_from_node0[ajucent_node] == -1 {
+                    distance_from_node0[ajucent_node] = distance + 1;
+                    breadth_queue.push_back(ajucent_node);
+                }
+            }
+        }
+    }
+
+    for (node, distance) in  distance_from_node0.into_iter().enumerate() {
+        println!("{} {}", node+1, distance);
+    }
+}
+
+fn main() {
+    let nodenum: usize = input::read_number();
+    let mut graph_matrix: Vec<Vec<usize>> = vec![vec![0; nodenum]; nodenum];
+    for _ in 0..nodenum {
+        let node_info: Vec<usize> = input::read_numline();
+        let node_num = node_info[0] -1;
+        let adjacent_node_count =  node_info[1];
+        for i in 0..adjacent_node_count {
+            let adjacent_node_num = node_info[2+i] -1;
+            graph_matrix[node_num][adjacent_node_num] = 1;
+        }
+    }
+
+    let mut distance_from_node0: Vec<i32> = vec![-1; nodenum];
+    breadch_search(&graph_matrix, &mut distance_from_node0);
+    
+}
diff --git a/chapter_12/graph_components/Cargo.lock b/chapter_12/graph_components/Cargo.lock
diff --git a/chapter_12/graph_components/Cargo.toml b/chapter_12/graph_components/Cargo.toml
@@ -0,0 +1,10 @@
+[package]
+name = "graph_components"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}
diff --git a/chapter_12/graph_components/input.txt b/chapter_12/graph_components/input.txt
@@ -0,0 +1,14 @@
+10 9 
+0 1
+0 2
+3 4
+5 7
+5 6
+6 7
+6 8
+7 8
+8 9
+3 
+0 1
+5 9
+1 3
diff --git a/chapter_12/graph_components/src/main.rs b/chapter_12/graph_components/src/main.rs
@@ -0,0 +1,54 @@
+fn find_partical_graph(graph_type_num: i32, node: usize, graph_list: &mut Vec<Vec<usize>>, node_type: &mut Vec<i32>) {
+    let mut search_stack: Vec<usize> = vec![];
+    search_stack.push(node);
+    node_type[node] = graph_type_num;
+
+    while !search_stack.is_empty() {
+        let this_node = *search_stack.last().unwrap();
+        let mut is_adjust_node_found = false;
+        for adjust_node in &graph_list[this_node] { 
+            if node_type[*adjust_node] == -1{
+                search_stack.push(*adjust_node);
+                node_type[*adjust_node] = graph_type_num;
+                is_adjust_node_found = true;
+                break;
+            }
+        }
+        if !is_adjust_node_found {
+            search_stack.pop();
+        }
+    }
+}
+
+fn main() {
+    let node_info: Vec<usize> = input::read_numline();
+    let node_num = node_info[0];
+    let input_info_lines = node_info[1];
+    let mut graph_list: Vec<Vec<usize>> = vec![vec![]; node_num];
+    for _ in 0..input_info_lines {
+        let node_pair: Vec<usize> = input::read_numline();
+        graph_list[node_pair[0]].push(node_pair[1]);
+        graph_list[node_pair[1]].push(node_pair[0]);
+    }
+    let mut graph_type_num: i32 = 0;
+    let mut node_type: Vec<i32> = vec![-1; node_num];
+
+    for node in 0.. node_num {
+        if node_type[node] == -1 {
+            find_partical_graph(graph_type_num, node, &mut graph_list, &mut node_type);
+            graph_type_num += 1;
+        }
+    }
+
+    let assert_count: usize = input::read_number();
+    for _ in 0..assert_count { 
+        let relation_info: Vec<usize> = input::read_numline();
+        let node0: usize  = relation_info[0];
+        let node1: usize = relation_info[1];
+        if node_type[node0] == node_type[node1] {
+            println!("yes");
+        }else {
+            println!("no");
+        }
+    }
+}
diff --git a/chapter_12/graph_depth_serch/Cargo.lock b/chapter_12/graph_depth_serch/Cargo.lock
diff --git a/chapter_12/graph_depth_serch/Cargo.toml b/chapter_12/graph_depth_serch/Cargo.toml
@@ -0,0 +1,10 @@
+[package]
+name = "graph_depth_serch"
+version = "0.1.0"
+authors = ["Yohei Osawa <yohei.osawa.318.niko8@gmail.com>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]
+input = {path = "../../library/input"}
diff --git a/chapter_12/graph_depth_serch/input.txt b/chapter_12/graph_depth_serch/input.txt
@@ -0,0 +1,7 @@
+6
+1 2 2 3
+2 2 3 4
+3 1 5
+4 1 6
+5 1 6
+6 0
diff --git a/chapter_12/graph_depth_serch/src/main.rs b/chapter_12/graph_depth_serch/src/main.rs

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+fn main() {`
	`2`	`+ println!("Hello, world!");`
	`3`	`+}`
-Original file line number
+Diff line change
@@ @@ -0,0 +1,5 @@ @@
 +4
 +1 2 2 4
 +2 1 4
 +3 0
 +4 1 3