搜索二维矩阵（LeetCode）
题目 解题 """时间复杂度为 O(log(m * n))，其中 m 是矩阵的行数，n 是矩阵的列数。""" def searchMatrix(matrix, target): if not matrix or not matrix[0]: return False m, n = len(matrix), len(matrix[0]) left, right = 0, m * n - 1 while ...
搜索二维矩阵 II（LeetCode）
题目 解题 """时间复杂度为 O(m + n)，其中 m 是矩阵的行数，n 是矩阵的列数。""" def searchMatrix(matrix, target) -> bool: if not matrix or not matrix[0]: return False # 从右上角开始搜索 row, col = 0, len(matrix[0]) - 1 while row < len(matri...
脉冲编码调制(PCM,Pulse Code Modulation)简介
脉冲编码调制(PCM,Pulse Code Modulation) 脉冲编码调制（PCM，Pulse Code Modulation）是一种将模拟信号转换为数字信号的技术。在音频处理、电话通信以及其他许多领域都有广泛应用。PCM通过采样、量化、编码等三个主要步骤将模拟信号转换为数字信号。 采样(Sampling) 在连续的模拟信号中以固定的时间间隔选取一系列的样本点。采样率（Sampling Rate）...
LeetCode //C - 258. Add Digits
1: Example 2: Constraints: 0 < = n u m < = 2 31 − 1 0 <= num <= 2^{31} - 1 0<=num<=231−1 From: LeetCode Link: 258. Add Digits Solution: Ideas: 1. Digital Root Concept: The digital root of a number is the...
LeetCode //C - 260. Single Number III
nums[i]<=231−1Each integer in nums will appear twice, only two integers will appear once. From: LeetCode Link: 260. Single Number III Solution: Ideas: Use of Unsigned Type: By casting xor_result to an uns...
《LeetCode热题100》---＜哈希三道＞
第一道：两数之和（简单） class Solution { public int[] twoSum(int[] nums, int target) { int left = 0,right = nums.length-1; Arrays.sort(nums); while (left < right){ if(nums[left] + nums[right] < target) { left++; }e...
分隔链表（LeetCode）
题目 解题 class ListNode: def __init__(self, val=0, next=None): self.val = val self.next = next def partition(head: ListNode, x: int) -> ListNode: # 创建两个虚拟头节点 smaller_head = ListNode(0) greater_head = ListNod...
【LeetCode 0002】【链表】两数相加
Add Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbe...
TX Barcode .NET for WPF Crack
TX Barcode .NET for WPF Crack Common word processing features: It can support the 1D as well as 2D barcodes for the users and developers. As we know barcodes are being included everywhere as well as i...
LeetCode //C - 237. Delete Node in a Linked List
node in the list is unique.The node to be deleted is in the list and is not a tail node. From: LeetCode Link: 237. Delete Node in a Linked List Solution: Ideas: Check for edge cases: The function first c...