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

Format the C code in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-17 21:13:15 +08:00
parent 1d6b7a5644
commit 9a98ff8a5e
46 changed files with 215 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/c/chapter_searching/linear_search.c
+5 -5
View File
@@ -19,7 +19,7 @@ int linearSearchArray(int *nums, int len, int target) {
}
/* 线性查找（链表） */
ListNode* linearSearchLinkedList(ListNode* head, int target) {
ListNode *linearSearchLinkedList(ListNode *head, int target) {
// 遍历链表
while (head != NULL) {
// 找到目标节点，返回之
@@ -36,14 +36,14 @@ int main() {
int target = 3;
/* 在数组中执行线性查找 */
int nums[10] = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int nums[10] = {1, 5, 3, 2, 4, 7, 5, 9, 10, 8};
int index = linearSearchArray(nums, 10, target);
printf("目标元素 3 的索引 = %d\n", index);
/* 在链表中执行线性查找 */
ListNode* head = arrToLinkedList(nums, 10);
ListNode* node = linearSearchLinkedList(head, target);
if(node == NULL) {
ListNode *head = arrToLinkedList(nums, 10);
ListNode *node = linearSearchLinkedList(head, target);
if (node == NULL) {
printf("目标节点值 3 的对应节点对象为 NULL\n");
} else {
printf("目标节点值 3 的对应节点对象为 addr: %p val: %d\n", node, node->val);