Hello 算法 1.2.0 繁体中文 Swift 版=== File: array.swift === /* 在陣列中查詢指定元素 */ func find(nums: [Int], target: Int) -> Int { for i in nums.indices { if nums[i] == target { return i } } return -1 } 7. 擴容陣列 在複雜的系統環境中,程式難以保證陣列之後的記憶 } 5. 查詢節點 走訪鏈結串列,查詢其中值為 target 的節點,輸出該節點在鏈結串列中的索引。此過程也屬於線性查詢。程 式碼如下所示: // === File: linked_list.swift === /* 在鏈結串列中查詢值為 target 的首個節點 */ func find(head: ListNode, target: Int) -> Int { var head: head: ListNode? = head var index = 0 while head != nil { if head?.val == target { return index } head = head?.next index += 1 } return -1 } 第 4 章 陣列與鏈結串列 www.hello‑algo.com 77 4.2.2 陣列 vs. 鏈結串列0 码力 | 379 页 | 18.79 MB | 10 月前3
Blender v2.92 参考手册(繁体中文版)contents between two areas with Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must to any node border. Snap Target Which part to snap onto the target. Snap closest point onto target. Snap center onto target. Snap median onto target. Snap active onto target. Auto-Offset When you drop Controls Transform Orientations Orientations Pivot Point Pivot Types Snapping Snap Element Snap Target Additional Snap Options Proportional Editing Controls Object Mode 編輯模式 範例 Mode: Panel: Shortcut:0 码力 | 3966 页 | 203.00 MB | 1 年前3
Blender v3.4 参考手册(繁体中文版)of two areas by pressing Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must the selected object in the Target field is a mesh or a lattice, an additional field is displayed where a vertex group can be selected. Bone If the selected object in the Target field is an armature, an the above. Snap Target Which part of the selected nodes to snap: Snap closest point onto target. Snap center of selected nodes onto target. Snap median of selected nodes onto target. Snap active node0 码力 | 4469 页 | 258.38 MB | 1 年前3
Blender v3.3 参考手册(繁体中文版)of two areas by pressing Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must the selected object in the Target field is a mesh or a lattice, an additional field is displayed where a vertex group can be selected. Bone If the selected object in the Target field is an armature, an the above. Snap Target Which part of the selected nodes to snap: Snap closest point onto target. Snap center of selected nodes onto target. Snap median of selected nodes onto target. Snap active node0 码力 | 4464 页 | 259.55 MB | 1 年前3
Blender v3.2 参考手册(繁体中文版)of two areas by pressing Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must to any node border. Snap Target Which part to snap onto the target. Snap closest point onto target. Snap center onto target. Snap median onto target. Snap active onto target. Auto-Offset When you drop the transformed element. By toggling the button that appears to the right of the snap target menu (see below), target objects will be considered as a whole when determining the volume center. Edge Center0 码力 | 4355 页 | 255.63 MB | 1 年前3
Blender v3.1 参考手册(繁体中文版)contents between two areas with Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must to any node border. Snap Target Which part to snap onto the target. Snap closest point onto target. Snap center onto target. Snap median onto target. Snap active onto target. Auto-Offset When you drop the transformed element. By toggling the button that appears to the right of the snap target menu (see below), target objects will be considered as a whole when determining the volume center. Edge Center0 码力 | 4393 页 | 256.31 MB | 1 年前3
Blender v3.0 参考手册(繁体中文版)contents between two areas with Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must to any node border. Snap Target Which part to snap onto the target. Snap closest point onto target. Snap center onto target. Snap median onto target. Snap active onto target. Auto-Offset When you drop the transformed element. By toggling the button that appears to the right of the snap target menu (see below), target objects will be considered as a whole when determining the volume center. Edge Center0 码力 | 4215 页 | 227.19 MB | 1 年前3
Blender v4.0 参考手册(繁体中文版)of two areas by pressing Ctrl-LMB on one of the corners of the initial area, dragging towards the target area, and releasing the mouse there. The two areas do not need to be side-by-side, though they must the selected object in the Target field is a mesh or a lattice, an additional field is displayed where a vertex group can be selected. Bone If the selected object in the Target field is an armature, an Combination of the above. Snap Target Which part of the selected nodes to snap: Closest: Snap closest point onto target. Center: Snap center of selected nodes onto target. Median: Snap median of selected0 码力 | 5220 页 | 303.08 MB | 1 年前3
Hello 算法 1.2.0 繁体中文 C# 版File: array.cs === /* 在陣列中查詢指定元素 */ int Find(int[] nums, int target) { for (int i = 0; i < nums.Length; i++) { if (nums[i] == target) return i; } return -1; } 7. 擴容陣列 在複雜的系統環境中,程式難以保證陣列之後的記憶 } 5. 查詢節點 走訪鏈結串列,查詢其中值為 target 的節點,輸出該節點在鏈結串列中的索引。此過程也屬於線性查詢。程 式碼如下所示: // === File: linked_list.cs === /* 在鏈結串列中查詢值為 target 的首個節點 */ int Find(ListNode? head, int target) { int index = 0; while while (head != null) { if (head.val == target) return index; head = head.next; index++; } return -1; } 4.2.2 陣列 vs. 鏈結串列 表 4‑1 總結了陣列和鏈結串列的各項特點並對比了操作效率。由於它們採用兩種相反的儲存策略,因此各種 性質和操作效率也呈現對立的特點。 表 4‑10 码力 | 379 页 | 18.79 MB | 10 月前3
Hello 算法 1.2.0 繁体中文 Dart 版array.dart === /* 在陣列中查詢指定元素 */ int find(Listnums, int target) { for (var i = 0; i < nums.length; i++) { if (nums[i] == target) return i; } return -1; } 7. 擴容陣列 在複雜的系統環境中,程式難以保證陣列之後的記憶體 } 5. 查詢節點 走訪鏈結串列,查詢其中值為 target 的節點,輸出該節點在鏈結串列中的索引。此過程也屬於線性查詢。程 式碼如下所示: // === File: linked_list.dart === /* 在鏈結串列中查詢值為 target 的首個節點 */ int find(ListNode? head, int target) { int index = 0; while while (head != null) { if (head.val == target) { return index; } head = head.next; index++; } return -1; } 4.2.2 陣列 vs. 鏈結串列 表 4‑1 總結了陣列和鏈結串列的各項特點並對比了操作效率。由於它們採用兩種相反的儲存策略,因此各種 性質和操作效率也呈現對立的特點。 0 码力 | 378 页 | 18.77 MB | 10 月前3
共 36 条
- 1
- 2
- 3
- 4













