9.5 随机与取样
addbit = cur_sum < 10? 0: 1;
} if (addbit) {
output += "1";
} reverse(output.begin(), output.end());
return output;
}
326. Power of Three (Easy)
3
Input: n = 27 Output: true
n
log = mn3m
3
bool isPowerOfThree(int n) { return fmod(log10(n) / log10(3), 1) == 0;
}
19
int33= 1162261467n3 1162261467n
bool isPowerOfThree(int n) { return n > 0 && 1162261467 % n == 0;
}
9.5
384. Shuffle an Array (Medium)
shuffle reset
Input: nums = [1,2,3], actions: ["shuffle","shuffle","reset"] Output: [[2,1,3],[3,2,1],[1,2,3]]
Fisher-Yates reset
class Solution { vector<int> origin;
public:
Solution(vector<int> nums): origin(std::move(nums)) {}
vector<int> reset() { return origin;
}
vector<int> shuffle() { if (origin.empty()) return {};
vector<int> shuffled(origin);
int n = origin.size();
// //
for (int i = n - 1; i >= 0; --i) { swap(shuffled[i], shuffled[rand() % (i + 1)]);
} //
// for (int i = 0; i < n; ++i) { //int pos = rand() % (n - i);
//swap(shuffled[i], shuffled[i+pos]);
// } return shuffled;
} };
528. Random Pick with Weight (Medium)
Input: weights = [1,3], actions: ["pickIndex","pickIndex","pickIndex"] Output: [0,1,1]
01/41 3/4
partial_sum
lower_bound [1,3][1,4]1lower_bound
0234lower_bound1
class Solution { vector<int> sums;
public:
Solution(vector<int> weights): sums(std::move(weights)) { partial_sum(sums.begin(), sums.end(), sums.begin());
}
int pickIndex() { int pos = (rand() % sums.back()) + 1;
return lower_bound(sums.begin(), sums.end(), pos) - sums.begin();
} };
382. Linked List Random Node (Medium)
Input: 1->2->3->4->5 Output: 3
3
m
m
全站分卷索引 · 68 卷
- 11 题目分类
- 22 最易懂的贪心算法
- 32.3 区间问题
- 42.4 练习
- 53 玩转双指针
- 63.2 Two Sum
- 73.4 快慢指针
- 83.5 滑动窗口
- 93.6 练习
- 104 居合斩!二分查找
- 114.3 查找区间
- 124.4 旋转数组查找数字
- 134.5 练习
- 145 千奇百怪的排序算法
- 155.2 快速选择
- 165.3 桶排序
- 175.4 练习
- 186 一切皆可搜索
- 196.3 回溯法
- 206.4 广度优先搜索
- 216.5 练习
- 227 深入浅出动态规划
- 237.3 基本动态规划:二维
- 247.4 分割类型题
- 257.5 子序列问题
- 267.6 背包问题
- 277.7 字符串编辑
- 287.8 股票交易
- 297.9 练习
- 308 化繁为简的分治法
- 318.3 练习
- 329 巧解数学问题
- 339.4 数字处理
- 349.5 随机与取样
- 359.6 练习
- 3610 神奇的位运算
- 3710.3 二进制特性
- 3810.4 练习
- 3911 妙用数据结构
- 4011.2 数组
- 4111.3 栈和队列
- 4211.4 单调栈
- 4311.5 优先队列
- 4411.6 双端队列
- 4511.7 哈希表
- 4611.8 多重集合和映射
- 4711.9 前缀和与积分图
- 4811.10 练习
- 11.10
- 566. Reshape the Matrix (Easy)
- 225. Implement Stack using Queues (Easy)
- 503. Next Greater Element II (Medium)
- 217. Contains Duplicate (Easy)
- 697. Degree of an Array (Easy)
- 594. Longest Harmonious Subsequence (Easy)
- 287. Find the Duplicate Number (Medium)
- 313. Super Ugly Number (Medium)
- 870. Advantage Shuffle (Medium)
- 307. Range Sum Query - Mutable (Medium)
- 4912 令人头大的字符串
- 5012.3 字符串理解
- 5112.4 字符串匹配
- 5212.5 练习
- 5313 指针三剑客之一:链表
- 5413.3 其它链表技巧
- 5513.4 练习
- 5614 指针三剑客之二:树
- 5714.3 层次遍历
- 5814.4 前中后序遍历
- 5914.5 二叉查找树
- 6014.6 字典树
- 6114.7 练习
- 14.7
- 226. Invert Binary Tree (Easy)
- 617. Merge Two Binary Trees (Easy)
- 572. Subtree of Another Tree (Easy)
- 404. Sum of Left Leaves (Easy)
- 513. Find Bottom Left Tree Value (Easy)
- 538. Convert BST to Greater Tree (Easy)
- 235. Lowest Common Ancestor of a Binary Search Tree (Easy)
- 530. Minimum Absolute Difference in BST (Easy)
- 889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)
- 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
- 94. Binary Tree Inorder Traversal (Medium)
- 6215 指针三剑客之三:图
- 6315.3 拓扑排序
- 6415.4 练习
- 6516 更加复杂的数据结构
- 6616.3 复合数据结构
- 6716.4 练习
- 6817 后记