《Hello 算法》：动画图解、一键运行的数据结构与算法教程。支持简中、繁中、English、日本語，提供 Python, Java, C++, C, C#, JS, Go, Swift, Rust, Ruby, Kotlin, TS, Dart 等代码实现
944 matches across 10 categories. Click a row to expand file-level details.
| Severity | File | Line | Snippet |
|---|---|---|---|
| HIGH | zh-hant/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_searching/binary_search.py | 0 | file: binary_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | …es/python/chapter_searching/binary_search_insertion.py | 0 | file: binary_search_insertion.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | …-hant/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_searching/hashing_search.py | 0 | file: hashing_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | …t/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | ja/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | ru/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | en/codes/python/chapter_searching/binary_search_edge.py | 0 | file: binary_search_edge.py created time: 2023-08-04 author: krahets (krahets@163.com) |
| HIGH | zh-hant/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_searching/linear_search.py | 0 | file: linear_search.py created time: 2022-11-26 author: timi (xisunyy@163.com) |
| HIGH | zh-hant/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) |
| HIGH | ja/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) |
| HIGH | ru/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) |
| HIGH | codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) |
| HIGH | en/codes/python/chapter_searching/two_sum.py | 0 | file: two_sum.py created time: 2022-11-25 author: krahets (krahets@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) |
| HIGH | ja/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) |
| HIGH | ru/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) |
| HIGH | codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) |
| HIGH | en/codes/python/chapter_sorting/bucket_sort.py | 0 | file: bucket_sort.py created time: 2023-03-30 author: krahets (krahets@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_sorting/quick_sort.py | 0 | file: quick_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) |
| HIGH | ja/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) |
| HIGH | ru/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) |
| HIGH | codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) |
| HIGH | en/codes/python/chapter_sorting/merge_sort.py | 0 | file: merge_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com), krahets (krahets@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_sorting/insertion_sort.py | 0 | file: insertion_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ja/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | ru/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | en/codes/python/chapter_sorting/bubble_sort.py | 0 | file: bubble_sort.py created time: 2022-11-25 author: timi (xisunyy@163.com) |
| HIGH | zh-hant/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) |
| HIGH | ja/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) |
| HIGH | ru/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) |
| HIGH | codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) |
| HIGH | en/codes/python/chapter_sorting/selection_sort.py | 0 | file: selection_sort.py created time: 2023-05-22 author: krahets (krahets@163.com) |
| 360 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| HIGH | zh-hant/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 71 | queue.push(3) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 72 | queue.push(2) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 73 | queue.push(5) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 74 | queue.push(4) |
| HIGH | …nt/codes/python/chapter_stack_and_queue/array_queue.py | 96 | queue.push(i) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 57 | self.push(num, True) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 61 | self.push(num, False) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 75 | queue.push(1) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 76 | queue.push(3) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 77 | queue.push(2) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 78 | queue.push(5) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 79 | queue.push(4) |
| HIGH | ja/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 71 | queue.push(3) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 72 | queue.push(2) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 73 | queue.push(5) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 74 | queue.push(4) |
| HIGH | ja/codes/python/chapter_stack_and_queue/array_queue.py | 96 | queue.push(i) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 57 | self.push(num, True) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 61 | self.push(num, False) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 75 | queue.push(1) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 76 | queue.push(3) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 77 | queue.push(2) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 78 | queue.push(5) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 79 | queue.push(4) |
| HIGH | ru/codes/python/chapter_heap/my_heap.py | 122 | max_heap.push(val) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_stack.py | 50 | stack.push(1) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_stack.py | 51 | stack.push(3) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_stack.py | 52 | stack.push(2) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_stack.py | 53 | stack.push(5) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_stack.py | 54 | stack.push(4) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 67 | stack.push(1) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 68 | stack.push(3) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 69 | stack.push(2) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 70 | stack.push(5) |
| HIGH | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 71 | stack.push(4) |
| HIGH | ru/codes/python/chapter_stack_and_queue/array_queue.py | 70 | queue.push(1) |
| 60 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { |
| HIGH | zh-hant/codes/javascript/chapter_heap/my_heap.js | 115 | print() { |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { |
| HIGH | …ant/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { |
| HIGH | ja/codes/javascript/chapter_heap/my_heap.js | 115 | print() { |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { |
| HIGH | ja/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { |
| HIGH | ru/codes/javascript/chapter_heap/my_heap.js | 115 | print() { |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { |
| HIGH | ru/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { |
| HIGH | codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { |
| HIGH | codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { |
| HIGH | codes/javascript/chapter_heap/my_heap.js | 115 | print() { |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { |
| HIGH | codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { |
| HIGH | codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { |
| HIGH | codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { |
| HIGH | …typescript/chapter_stack_and_queue/linkedlist_deque.ts | 119 | print(): void { |
| HIGH | …des/typescript/chapter_graph/graph_adjacency_matrix.ts | 89 | print(): void { |
| HIGH | …codes/typescript/chapter_graph/graph_adjacency_list.ts | 83 | print(): void { |
| HIGH | …/codes/typescript/chapter_hashing/hash_map_chaining.ts | 110 | print(): void { |
| HIGH | …typescript/chapter_hashing/hash_map_open_addressing.ts | 144 | print(): void { |
| HIGH | en/codes/javascript/chapter_heap/my_heap.js | 115 | print() { |
| HIGH | …javascript/chapter_stack_and_queue/linkedlist_deque.js | 119 | print() { |
| HIGH | …codes/javascript/chapter_graph/graph_adjacency_list.js | 83 | print() { |
| HIGH | …des/javascript/chapter_graph/graph_adjacency_matrix.js | 89 | print() { |
| HIGH | …/codes/javascript/chapter_hashing/hash_map_chaining.js | 108 | print() { |
| HIGH | en/codes/javascript/chapter_hashing/array_hash_map.js | 83 | print() { |
| HIGH | …javascript/chapter_hashing/hash_map_open_addressing.js | 141 | print() { |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: |
| LOW | …-hant/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { |
| LOW | zh-hant/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) |
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: |
| LOW | ja/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { |
| LOW | ja/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) |
| LOW | …es/python/chapter_searching/binary_search_insertion.py | 8 | def binary_search_insertion_simple(nums: list[int], target: int) -> int: |
| LOW | ru/codes/python/chapter_searching/hashing_search.py | 21 | def hashing_search_linkedlist( |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.py | 8 | def climbing_stairs_constraint_dp(n: int) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 8 | def min_cost_climbing_stairs_dp(cost: list[int]) -> int: |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.py | 23 | def min_cost_climbing_stairs_dp_comp(cost: list[int]) -> int: |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.py | 23 | def climbing_stairs_backtrack(n: int) -> int: |
| LOW | …thon/chapter_dynamic_programming/unbounded_knapsack.py | 25 | def unbounded_knapsack_dp_comp(wgt: list[int], val: list[int], cap: int) -> int: |
| LOW | …ypescript/chapter_searching/binary_search_insertion.ts | 8 | function binarySearchInsertionSimple( |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.ts | 26 | function minCostClimbingStairsDPComp(cost: Array<number>): number { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.ts | 8 | function climbingStairsConstraintDP(n: number): number { |
| LOW | …avascript/chapter_searching/binary_search_insertion.js | 8 | function binarySearchInsertionSimple(nums, target) { |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.js | 26 | function minCostClimbingStairsDPComp(cost) { |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.js | 8 | function climbingStairsConstraintDP(n) { |
| LOW | ru/codes/ruby/chapter_searching/hashing_search.rb | 17 | def hashing_search_linkedlist(hmap, target) |
| LOW | …odes/ruby/chapter_searching/binary_search_insertion.rb | 8 | def binary_search_insertion_simple(nums, target) |
| LOW | …ruby/chapter_dynamic_programming/unbounded_knapsack.rb | 28 | def unbounded_knapsack_dp_comp(wgt, val, cap) |
| LOW | …apter_dynamic_programming/climbing_stairs_backtrack.rb | 23 | def climbing_stairs_backtrack(n) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 8 | def min_cost_climbing_stairs_dp(cost) |
| LOW | …ter_dynamic_programming/min_cost_climbing_stairs_dp.rb | 21 | def min_cost_climbing_stairs_dp_comp(cost) |
| LOW | …r_dynamic_programming/climbing_stairs_constraint_dp.rb | 8 | def climbing_stairs_constraint_dp(n) |
| 40 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | zh-hant/codes/go/pkg/tree_node.go | 21 | Right: nil, |
| LOW | zh-hant/codes/python/modules/tree_node.py | 21 | # 二元樹的陣列表示： |
| LOW | zh-hant/codes/rust/include/tree_node.rs | 41 | |
| LOW | zh-hant/codes/rust/src/include/tree_node.rs | 41 | |
| LOW | zh-hant/codes/java/utils/TreeNode.java | 21 | } |
| LOW | zh-hant/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | zh-hant/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; |
| LOW | zh-hant/codes/cpp/utils/common.hpp | 1 | /** |
| LOW | zh-hant/codes/cpp/utils/common.hpp | 21 | #include <vector> |
| LOW | zh-hant/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ |
| LOW | zh-hant/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | zh-hant/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| LOW | zh-hant/codes/c/utils/uthash.h | 41 | #endif |
| LOW | zh-hant/codes/c/utils/uthash.h | 61 | #endif |
| LOW | zh-hant/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ |
| LOW | zh-hant/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi |
| LOW | zh-hant/codes/c/utils/uthash.h | 121 | |
| LOW | zh-hant/codes/c/utils/common.h | 1 | /** |
| LOW | zh-hant/codes/c/utils/common.h | 21 | #include "vertex.h" |
| LOW | ja/codes/go/pkg/tree_node.go | 21 | Right: nil, |
| LOW | ja/codes/python/modules/tree_node.py | 21 | # 二分木の配列表現: |
| LOW | ja/codes/rust/src/include/tree_node.rs | 41 | |
| LOW | ja/codes/java/utils/TreeNode.java | 21 | } |
| LOW | ja/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | ja/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; |
| LOW | ja/codes/cpp/utils/common.hpp | 1 | /** |
| LOW | ja/codes/cpp/utils/common.hpp | 21 | #include <vector> |
| LOW | ja/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ |
| LOW | ja/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | ja/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| LOW | ja/codes/c/utils/uthash.h | 41 | #endif |
| LOW | ja/codes/c/utils/uthash.h | 61 | #endif |
| LOW | ja/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ |
| LOW | ja/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi |
| LOW | ja/codes/c/utils/uthash.h | 121 | |
| LOW | ja/codes/c/utils/common.h | 1 | /** |
| LOW | ja/codes/c/utils/common.h | 21 | #include "vertex.h" |
| LOW | ru/codes/go/pkg/tree_node.go | 21 | Right: nil, |
| LOW | ru/codes/python/modules/tree_node.py | 21 | # Массивное представление двоичного дерева: |
| LOW | ru/codes/rust/src/include/tree_node.rs | 41 | |
| LOW | ru/codes/java/utils/TreeNode.java | 21 | } |
| LOW | ru/codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | ru/codes/cpp/utils/tree_node.hpp | 21 | TreeNode() = default; |
| LOW | ru/codes/cpp/utils/common.hpp | 1 | /** |
| LOW | ru/codes/cpp/utils/common.hpp | 21 | #include <vector> |
| LOW | ru/codes/swift/utils/TreeNode.swift | 21 | // https://www.hello-algo.com/chapter_tree/array_representation_of_tree/ |
| LOW | ru/codes/c/utils/tree_node.h | 41 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| LOW | ru/codes/c/utils/uthash.h | 21 | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| LOW | ru/codes/c/utils/uthash.h | 41 | #endif |
| LOW | ru/codes/c/utils/uthash.h | 61 | #endif |
| LOW | ru/codes/c/utils/uthash.h | 81 | #define uthash_free(ptr,sz) free(ptr) /* free fcn */ |
| LOW | ru/codes/c/utils/uthash.h | 101 | #ifndef uthash_expand_fyi |
| LOW | ru/codes/c/utils/uthash.h | 121 | |
| LOW | ru/codes/c/utils/common.h | 1 | /** |
| LOW | ru/codes/c/utils/common.h | 21 | #include "vertex.h" |
| LOW | codes/go/pkg/tree_node.go | 21 | Right: nil, |
| LOW | codes/python/modules/tree_node.py | 21 | # 二叉树的数组表示： |
| LOW | codes/rust/src/include/tree_node.rs | 41 | |
| LOW | codes/java/utils/TreeNode.java | 21 | } |
| LOW | codes/kotlin/utils/TreeNode.kt | 21 | // [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15] |
| 31 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | zh-hant/codes/python/chapter_tree/array_binary_tree.py | 11 | |
| LOW | zh-hant/codes/python/modules/tree_node.py | 7 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 3 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 6 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 11 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 12 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | |
| LOW | zh-hant/codes/python/modules/__init__.py | 13 | |
| LOW | …t/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | |
| LOW | ja/codes/python/chapter_tree/array_binary_tree.py | 11 | |
| LOW | ja/codes/python/modules/tree_node.py | 7 | |
| LOW | ja/codes/python/modules/__init__.py | 3 | |
| LOW | ja/codes/python/modules/__init__.py | 6 | |
| LOW | ja/codes/python/modules/__init__.py | 6 | |
| LOW | ja/codes/python/modules/__init__.py | 6 | |
| LOW | ja/codes/python/modules/__init__.py | 11 | |
| LOW | ja/codes/python/modules/__init__.py | 11 | |
| LOW | ja/codes/python/modules/__init__.py | 11 | |
| LOW | ja/codes/python/modules/__init__.py | 12 | |
| LOW | ja/codes/python/modules/__init__.py | 12 | |
| LOW | ja/codes/python/modules/__init__.py | 12 | |
| LOW | ja/codes/python/modules/__init__.py | 13 | |
| LOW | ja/codes/python/modules/__init__.py | 13 | |
| LOW | ja/codes/python/modules/__init__.py | 13 | |
| LOW | ja/codes/python/modules/__init__.py | 13 | |
| LOW | ja/codes/python/modules/__init__.py | 13 | |
| LOW | ja/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | |
| LOW | ru/codes/python/chapter_tree/array_binary_tree.py | 11 | |
| LOW | ru/codes/python/modules/tree_node.py | 7 | |
| LOW | ru/codes/python/modules/__init__.py | 3 | |
| LOW | ru/codes/python/modules/__init__.py | 6 | |
| LOW | ru/codes/python/modules/__init__.py | 6 | |
| LOW | ru/codes/python/modules/__init__.py | 6 | |
| LOW | ru/codes/python/modules/__init__.py | 11 | |
| LOW | ru/codes/python/modules/__init__.py | 11 | |
| LOW | ru/codes/python/modules/__init__.py | 11 | |
| LOW | ru/codes/python/modules/__init__.py | 12 | |
| LOW | ru/codes/python/modules/__init__.py | 12 | |
| LOW | ru/codes/python/modules/__init__.py | 12 | |
| LOW | ru/codes/python/modules/__init__.py | 13 | |
| LOW | ru/codes/python/modules/__init__.py | 13 | |
| LOW | ru/codes/python/modules/__init__.py | 13 | |
| LOW | ru/codes/python/modules/__init__.py | 13 | |
| LOW | ru/codes/python/modules/__init__.py | 13 | |
| LOW | ru/codes/python/chapter_graph/graph_adjacency_matrix.py | 11 | |
| LOW | codes/python/chapter_tree/array_binary_tree.py | 11 | |
| LOW | codes/python/modules/tree_node.py | 7 | |
| LOW | codes/python/modules/__init__.py | 3 | |
| LOW | codes/python/modules/__init__.py | 6 | |
| LOW | codes/python/modules/__init__.py | 6 | |
| LOW | codes/python/modules/__init__.py | 6 | |
| 30 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | en/codes/python/chapter_sorting/insertion_sort.py | 18 | nums[j + 1] = base # Assign base to the correct position |
| LOW | en/codes/python/chapter_heap/my_heap.py | 135 | # Check if heap is empty |
| LOW | en/codes/python/chapter_heap/heap.py | 62 | # Check if heap is empty |
| LOW | en/codes/python/chapter_array_and_linkedlist/array.py | 37 | # Assign num to the element at index index |
| LOW | en/codes/python/chapter_stack_and_queue/array_stack.py | 70 | # Check if it is empty |
| LOW | en/codes/python/chapter_stack_and_queue/queue.py | 37 | # Check if the queue is empty |
| LOW | en/codes/python/chapter_stack_and_queue/deque.py | 40 | # Check if the double-ended queue is empty |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_stack.py | 87 | # Check if it is empty |
| LOW | en/codes/python/chapter_stack_and_queue/array_deque.py | 127 | # Check if the double-ended queue is empty |
| LOW | en/codes/python/chapter_stack_and_queue/stack.py | 34 | # Check if it is empty |
| LOW | en/codes/python/chapter_stack_and_queue/array_queue.py | 90 | # Check if the queue is empty |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_deque.py | 149 | # Check if the double-ended queue is empty |
| LOW | …des/python/chapter_stack_and_queue/linkedlist_queue.py | 95 | # Check if the queue is empty |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.py | 43 | # Check if it is a solution |
| LOW | en/codes/ruby/chapter_sorting/insertion_sort.rb | 19 | nums[j + 1] = base # Assign base to the correct position |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 48 | ### Check if heap is empty ### |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 125 | # Check if heap is empty |
| LOW | en/codes/ruby/chapter_heap/my_heap.rb | 144 | # Check if heap is empty |
| LOW | en/codes/ruby/chapter_array_and_linkedlist/array.rb | 40 | # Assign num to the element at index index |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb | 21 | ### Check if queue is empty ### |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_queue.rb | 98 | # Check if the queue is empty |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb | 31 | ### Check if deque is empty ### |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_deque.rb | 165 | # Check if the double-ended queue is empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_queue.rb | 24 | ### Check if queue is empty ### |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_queue.rb | 97 | # Check if the queue is empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/stack.rb | 34 | # Check if empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_deque.rb | 24 | ### Check if deque is empty ### |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_deque.rb | 142 | # Check if the double-ended queue is empty |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb | 18 | ### Check if stack is empty ### |
| LOW | …codes/ruby/chapter_stack_and_queue/linkedlist_stack.rb | 84 | # Check if empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/deque.rb | 39 | # Check if the double-ended queue is empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/queue.rb | 35 | # Check if the queue is empty |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_stack.rb | 19 | ### Check if stack is empty ### |
| LOW | en/codes/ruby/chapter_stack_and_queue/array_stack.rb | 75 | # Check if empty |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 10 | ### Check if current state is solution ### |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 20 | ### Check if choice is valid in current state ### |
| LOW | …hapter_backtracking/preorder_traversal_iii_template.rb | 37 | # Check if it is a solution |
| Severity | File | Line | Snippet |
|---|---|---|---|
| MEDIUM | zh-hant/codes/dart/build.dart | 16 | print('Error: $e'); |
| MEDIUM | zh-hant/codes/dart/build.dart | 28 | print('Error: $e'); |
| MEDIUM | zh-hant/codes/dart/build.dart | 38 | print('Error: $errorCount'); |
| MEDIUM | ja/codes/dart/build.dart | 16 | print('Error: $e'); |
| MEDIUM | ja/codes/dart/build.dart | 28 | print('Error: $e'); |
| MEDIUM | ja/codes/dart/build.dart | 38 | print('Error: $errorCount'); |
| MEDIUM | ru/codes/dart/build.dart | 16 | print('Error: $e'); |
| MEDIUM | ru/codes/dart/build.dart | 28 | print('Error: $e'); |
| MEDIUM | ru/codes/dart/build.dart | 38 | print('Error: $errorCount'); |
| MEDIUM | codes/dart/build.dart | 16 | print('Error: $e'); |
| MEDIUM | codes/dart/build.dart | 28 | print('Error: $e'); |
| MEDIUM | codes/dart/build.dart | 38 | print('Error: $errorCount'); |
| MEDIUM | en/codes/dart/build.dart | 16 | print('Error: $e'); |
| MEDIUM | en/codes/dart/build.dart | 28 | print('Error: $e'); |
| MEDIUM | en/codes/dart/build.dart | 38 | print('Error: $errorCount'); |
| Severity | File | Line | Snippet |
|---|---|---|---|
| MEDIUM | en/codes/python/chapter_sorting/merge_sort.py | 11 | # Create a temporary array tmp to store the merged results |
| MEDIUM | …s/python/chapter_computational_complexity/iteration.py | 20 | i = 1 # Initialize condition variable |
| MEDIUM | …s/python/chapter_computational_complexity/iteration.py | 31 | i = 1 # Initialize condition variable |
| MEDIUM | en/codes/python/chapter_array_and_linkedlist/my_list.py | 76 | # Create a new array with length _extend_ratio times the original array, and copy the original array to the new |
| MEDIUM | …des/ruby/chapter_computational_complexity/iteration.rb | 22 | i = 1 # Initialize condition variable |
| MEDIUM | …des/ruby/chapter_computational_complexity/iteration.rb | 36 | i = 1 # Initialize condition variable |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | zh-hant/codes/python/chapter_tree/avl_tree.py | 121 | |
| LOW | ja/codes/python/chapter_tree/avl_tree.py | 121 | |
| LOW | ru/codes/python/chapter_tree/avl_tree.py | 121 | |
| LOW | codes/python/chapter_tree/avl_tree.py | 121 | |
| LOW | en/codes/python/chapter_tree/avl_tree.py | 121 |