xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-22 00:07:13 +00:00
Code Issues Packages Projects Releases Wiki Activity

cargo fmt rust code (#1131)

Browse Source 
* cargo fmt code

* Add empty line to seperate unrelated comments

* Fix review

* Update bubble_sort.rs

* Update merge_sort.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
rongyi
2024-03-16 02:13:41 +08:00
committed by GitHub
parent 54ceef3443
commit 7b1094318b
70 changed files with 1021 additions and 836 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/rust/chapter_searching/linear_search.rs
+10 -5
View File
@@ -6,9 +6,9 @@
include!("../include/include.rs");
use std::rc::Rc;
use std::cell::RefCell;
use list_node::ListNode;
use std::cell::RefCell;
use std::rc::Rc;
/* 线性查找（数组） */
fn linear_search_array(nums: &[i32], target: i32) -> i32 {
@@ -24,9 +24,14 @@ fn linear_search_array(nums: &[i32], target: i32) -> i32 {
}
/* 线性查找（链表） */
fn linear_search_linked_list(head: Rc<RefCell<ListNode<i32>>>, target: i32) -> Option<Rc<RefCell<ListNode<i32>>>> {
fn linear_search_linked_list(
head: Rc<RefCell<ListNode<i32>>>,
target: i32,
) -> Option<Rc<RefCell<ListNode<i32>>>> {
// 找到目标节点，返回之
if head.borrow().val == target {return Some(head)};
if head.borrow().val == target {
return Some(head);
};
// 找到目标节点，返回之
if let Some(node) = &head.borrow_mut().next {
return linear_search_linked_list(node.clone(), target);
@@ -40,7 +45,7 @@ pub fn main() {
let target = 3;
/* 在数组中执行线性查找 */
let nums = [ 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 ];
let nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
let index = linear_search_array(&nums, target);
println!("目标元素 3 的索引 = {}", index);