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

feat: Add Dart codes for chapter_backtracking and chapter_divide_and_conquer (#680)

Browse Source 
* feat: Add Dart codes for chapter_backtracking

* feat: Add Dart codes for chapter_divide_and_conquer

* Format Dart Code
This commit is contained in:
liuyuxin
2023-08-10 23:48:56 +08:00
committed by GitHub
parent e97eee0e18
commit 4325974af1
19 changed files with 731 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/dart/chapter_searching/hashing_search.dart
+6 -6
View File
@@ -18,7 +18,7 @@ int hashingSearchArray(Map<int, int> map, int target) {
}
/* 哈希查找（链表） */
ListNode? hashingSearchLinkedList(Map<int,ListNode> map, int target) {
ListNode? hashingSearchLinkedList(Map<int, ListNode> map, int target) {
// 哈希表的 key: 目标节点值，value: 节点对象
// 若哈希表中无此 key ，返回 null
if (!map.containsKey(target)) {
@@ -28,15 +28,15 @@ ListNode? hashingSearchLinkedList(Map<int,ListNode> map, int target) {
}
/* Driver Code */
void main(){
void main() {
int target = 3;
/* 哈希查找（数组） */
List<int> nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
Map<int,int> map = HashMap();
Map<int, int> map = HashMap();
for (int i = 0; i < nums.length; i++) {
map.putIfAbsent(nums[i], () => i);// key: 元素，value: 索引
map.putIfAbsent(nums[i], () => i); // key: 元素，value: 索引
}
int index = hashingSearchArray(map, target);
print('目标元素 3 的索引 = $index');
@@ -44,11 +44,11 @@ void main(){
/* 哈希查找（链表） */
ListNode? head = listToLinkedList(nums);
// 初始化哈希表
Map<int,ListNode> map1 = HashMap();
Map<int, ListNode> map1 = HashMap();
while (head != null) {
map1.putIfAbsent(head.val, () => head!); // key: 节点值，value: 节点
head = head.next;
}
ListNode? node = hashingSearchLinkedList(map1, target);
print('目标节点值 3 的对应节点对象为 $node');
}
}
codes/dart/chapter_searching/linear_search.dart
+3 -4
View File
@@ -24,8 +24,7 @@ ListNode? linearSearchList(ListNode? head, int target) {
// 遍历链表
while (head != null) {
// 找到目标节点，返回之
if (head.val == target)
return head;
if (head.val == target) return head;
head = head.next;
}
// 未找到目标元素，返回 null
@@ -33,7 +32,7 @@ ListNode? linearSearchList(ListNode? head, int target) {
}
/* Driver Code */
void main(){
void main() {
int target = 3;
/* 在数组中执行线性查找 */
@@ -45,4 +44,4 @@ void main(){
ListNode? head = listToLinkedList(nums);
ListNode? node = linearSearchList(head, target);
print('目标节点值 3 的对应节点对象为 $node');
}
}