算法
文章平均质量分 59
time_exceed
这个作者很懒,什么都没留下…
展开
-
focal loss的一些思考
focal loss的一些思考关于分类器新的改变功能快捷键合理的创建标题,有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能,丰富你的文章UML 图表FLowchart流程图导出与导入导出导入关于分类器分类器是通常输出的是属于某一类的概率。通常来说,一个强的分类器在预测的分数上很好的区分样本,一个弱的分类器则容易混淆。我们原创 2021-09-18 09:46:00 · 910 阅读 · 0 评论 -
将检测看做机器学习问题
将检测看做机器学习问题检测问题经典的建模经典建模的问题问题1:box太多的问题分类规则不明确输出的冗余前后背景平衡(经典问题)检测问题经典的建模检测的问题是输入为一张图片,输出一些可能是框,并且对框进行分类。所以检测的建模可以形式化的表达成:Detection = classification(boxes)label对于分类来说,背景类别为0,前景类别为1对于box来说,一个图像里产生的框是无穷的分类的规则(对每个框归属一个类别)如果一个框在GT的集合里,则类别为{1,C}否则,为背景原创 2021-09-07 20:45:36 · 212 阅读 · 0 评论 -
Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.Example 1:Input: n = 12Output: 3 Explanation: 12 = 4 + 4 + 4.Example 2...原创 2018-07-03 11:10:15 · 234 阅读 · 0 评论 -
Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.Example:Input: [0,1,0,3,12]Output: [1,3,12,0,0]Note:You mus...原创 2018-07-03 11:26:47 · 158 阅读 · 0 评论 -
Find the Duplicate Number
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, fi...原创 2018-07-03 11:44:06 · 109 阅读 · 0 评论 -
Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4 Explanation: The longest increasing subsequence is [2,3,7,101...原创 2018-07-03 15:01:04 · 137 阅读 · 0 评论 -
Coin Change
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money...原创 2018-07-03 17:15:16 · 155 阅读 · 0 评论 -
House Robber III
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour...原创 2018-07-03 18:05:17 · 159 阅读 · 0 评论 -
Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it mus...原创 2018-07-05 20:04:04 · 227 阅读 · 0 评论 -
Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Coul...原创 2018-07-05 20:37:54 · 171 阅读 · 0 评论 -
检测改进的一些方法
比较好用的方法就是 1.扩大图像输入 2.更好的backbone 3.FPN 4.增强浅层的feature的semantic信息原创 2018-07-24 19:17:34 · 476 阅读 · 0 评论 -
Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in each ...原创 2018-07-03 10:23:18 · 122 阅读 · 0 评论 -
Product of Array Except Self
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input: [1,2,3,4]Output: ...原创 2018-07-02 20:45:39 · 131 阅读 · 0 评论 -
Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p ...原创 2018-07-02 20:30:09 · 110 阅读 · 0 评论 -
pat1020
1020. Tree Traversals (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueSuppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder t原创 2016-10-11 09:11:44 · 329 阅读 · 0 评论 -
Bitwise AND of Numbers Range
201. Bitwise AND of Numbers RangeGiven a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.Example 1:Input: [5,7]Output: 4...原创 2018-06-30 17:09:53 · 109 阅读 · 0 评论 -
Happy Number
Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares...原创 2018-06-30 19:24:47 · 100 阅读 · 0 评论 -
Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Example:Input: 1->2->6->3->4->5->6, val = 6Output: 1->2->3->4->5这题比较简单,有一点要记住的是,如果删除当前节点,那么...原创 2018-06-30 19:43:11 · 107 阅读 · 0 评论 -
Reverse Linked List
Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed either iteratively or recursivel...原创 2018-06-30 19:54:27 · 96 阅读 · 0 评论 -
Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.Example: Input: s = 7, n...原创 2018-07-02 10:01:06 · 98 阅读 · 0 评论 -
Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Note: Do not modify the linked list.Follow up:Can you solve it without using extra space?这题比较经典,首先...原创 2018-07-02 12:06:23 · 101 阅读 · 0 评论 -
Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element alwa...原创 2018-07-02 19:09:22 · 103 阅读 · 0 评论 -
Maximal Square
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.Example:Input: 1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0Output: 4这题是一道简单的动态规划。...原创 2018-07-02 19:38:48 · 86 阅读 · 0 评论 -
Invert Binary Tree
Invert a binary tree.Example:Input: 4 / \ 2 7 / \ / \1 3 6 9Output: 4 / \ 7 2 / \ / \9 6 3 1先序遍历并交换左右的元素。/** * Definition for a binary tree ...原创 2018-07-02 19:44:19 · 119 阅读 · 0 评论 -
KMP算法 的思想
代码:#include#include#includeusing namespace std;void getNext(const std::string& p, std::vector& next){ next.resize(p.size()); next[0] = -1; int i = 0, j = -1; while (i != p.原创 2015-07-17 16:29:13 · 386 阅读 · 0 评论