kunpeng

LeetCode 13. Roman to IntegerLeetCode-13 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and

2021-09-23 LeetCode

哈希表

LeetCode 23. Merge k Sorted ListsLeetCode-23 You are given an array of k linked-lists lists, each linked-list is sorted

2021-09-23 LeetCode

堆链表

分组背包有 N 组物品和一个容量是 V 的背包。每组物品有若干个，同一组内的物品最多只能选一个。每件物品的体积是 vij，价值是 wij，其中 i 是组号，j 是组内编号。求解将哪些物品装入背包，可使物品总体积不超过背包容量，且总价值最

2021-09-23 LeetCode

背包

01背包动态规划五部曲1、确定dp数组以及下标的含义使用二维数组，dp[i][j]表示对于下标为0~i的物品，背包重量为j时的最大价值背包最大重量为4 重量价值物品0 1 15 物品1 3 20 物品2 4

2021-09-23 LeetCode

背包

基础操作用数组获得链表，用尾插法，迭代正向输出，递归反向输出 struct ListNode { int val; ListNode *next; ListNode() : val(0), next(nul

2021-09-23 LeetCode

链表

统计基础的，统计连续出现的1 485-最大连续1的个数int findMaxConsecutiveOnes(vector<int>& nums) { int cnt = 0, res = 0; for

2021-09-23 LeetCode

数组

LeetCode 347. Top K Frequent ElementsLeetCode-347 Given an integer array nums and an integer k, return the k most freque

2021-09-22 LeetCode

堆

LeetCode 25. Reverse Nodes in k-GroupLeetCode-25 Given a linked list, reverse the nodes of a linked list k at a time and

2021-09-22 LeetCode

链表

多旋翼动量定理惯性系 m\dot{v} = mg + R \sum_{k=1}^{4}{F_k}因为$F_k$是体轴系下多旋翼的升力，所以要左乘旋转矩阵转换到地理坐标系下同时，因为$F_k$都是垂直于机体平面，沿体轴$z_b$方向，所以旋转

2021-09-21 多旋翼

多旋翼

LeetCode 56. Merge IntervalsLeetCode-56 Given an array of intervals where intervals[i] = [starti, endi], merge all overl

2021-09-21 LeetCode

模拟

LeetCode 21. Merge Two Sorted ListsLeetCode-21 Merge two sorted linked lists and return it as a sorted list. The list sh

2021-09-18 LeetCode

链表

LeetCode 8. String to Integer (atoi)LeetCode-8 Implement the myAtoi(string s) function, which converts a string to a 32-

2021-09-18 LeetCode

字符串模拟