作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址: https://leetcode.com/problems/generate-random-point-in-a-circle/description/ 题目描述: Given the radius and x-y positions of the center of a circle, write a function randPoint which generates…
1. 问题 给定一个圆的半径和圆心坐标,生成圆内点的坐标. 2. 思路 简单说 (1)在圆内随机取点不好做,但是如果画出这个圆的外接正方形,在正方形里面采样就好做了. (2)取两个random确定正方形内的横坐标和纵坐标即可在正方形内采样. (3)如果采样到的点不在圆内,则丢弃,继续采样,当采样的点在圆内,则返回该点. (4)这样采样可以视作在圆内采样的一种近似,到这里就可以把问题解决了.下面是一些扩展知识. 拒绝采样(Reject Sampling)的解释 这个方法利用了拒绝采样的方法,该方法…
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址: https://leetcode.com/problems/random-point-in-non-overlapping-rectangles/description/ 题目描述: Given a list of non-overlapping axis-aligned rectangles rects, write a function pick which rando…
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 双指针 日期 [LeetCode] https://leetcode.com/problems/remove-duplicates-from-sorted-array/ Total Accepted: 129010 Total Submissions: 384622 Difficulty: Easy 题目描述 Given a sorted array…
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 迭代 日期 题目地址:https://leetcode.com/problems/delete-node-in-a-bst/description/ 题目描述 Given a root node reference of a BST and a key, delete the node with the given key in the BST. Re…
[LeetCode]380. Insert Delete GetRandom O(1) 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/insert-delete-getrandom-o1/description/ 题目描述: Design a data structure that supports all following oper…
[LeetCode]95. Unique Binary Search Trees II 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.me/ 题目地址:https://leetcode.com/problems/unique-binary-search-trees-ii/description/ 题目描述: Given an integer n, generate all s…
[LeetCode]Longest Word in Dictionary through Deleting 解题报告 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/#/description 题目描述: Given a string and a string dictionary, find the longest string in the di…
[LeetCode]129. Sum Root to Leaf Numbers 解题报告(Python) 标签(空格分隔): LeetCode 题目地址:https://leetcode.com/problems/sum-root-to-leaf-numbers/description/ 题目描述: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a numbe…
[LeetCode]873. Length of Longest Fibonacci Subsequence 解题报告(Python) 标签(空格分隔): LeetCode 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/description/ 题目描述: A sequence X_…