<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Kuroneko]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cyr429</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cyr429]]></copyright><item><title><![CDATA[关于用postman测试上传文件出现500错误The current request is not a multipart request的讨论]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/104735735</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/104735735</guid><author>cyr429</author><pubDate>Sun, 08 Mar 2020 16:56:29 +0800</pubDate><description><![CDATA[Controller中的代码是这样的：


    @RequestMapping(path={"/upload_image/"},method={RequestMethod.POST})
    @ResponseBody
    public String uploadImage(@RequestParam("file") MultipartFile file)

后面是方法主体。

测试时使...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [15]*: 102. Binary Tree Level Order Traversal 二叉树层次遍历]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/104055825</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/104055825</guid><author>cyr429</author><pubDate>Tue, 21 Jan 2020 16:18:51 +0800</pubDate><description><![CDATA[102.Binary Tree Level Order Traversal

Medium

215858Add to ListShare

Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).

For exam...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [14]*: 98. Validate Binary Search Tree 检查是否是二叉搜索树]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/104055183</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/104055183</guid><author>cyr429</author><pubDate>Mon, 20 Jan 2020 19:45:14 +0800</pubDate><description><![CDATA[Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

The left subtree of a node contains only nodes with keysless thanthe node's key.
	...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [12]*: 91. Decode Ways]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103889961</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103889961</guid><author>cyr429</author><pubDate>Wed, 08 Jan 2020 14:02:25 +0800</pubDate><description><![CDATA[A message containing letters fromA-Zis being encoded to numbers using the following mapping:


'A' -&gt; 1
'B' -&gt; 2
...
'Z' -&gt; 26


Given anon-emptystring containing only digits, determine ...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [11]: 90. Subsets II]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103879928</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103879928</guid><author>cyr429</author><pubDate>Tue, 07 Jan 2020 18:52:16 +0800</pubDate><description><![CDATA[Given a collection of integers that might contain duplicates,nums, return all possible subsets (the power set).

Note:The solution set must not contain duplicate subsets.

Example:


Input: [1,2,2]...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [10]: 86. Partition List]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103876479</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103876479</guid><author>cyr429</author><pubDate>Tue, 07 Jan 2020 18:17:19 +0800</pubDate><description><![CDATA[Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.

You should preserve the original relative order of the nodes in each of ...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [9]: 74. Search a 2D Matrix]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103636926</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103636926</guid><author>cyr429</author><pubDate>Fri, 20 Dec 2019 18:19:13 +0800</pubDate><description><![CDATA[Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:

Integers in each row are sorted from left to right.
	The first integer of each ro...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [8]: 73. Set Matrix Zeroes*]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103586770</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103586770</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 20:24:09 +0800</pubDate><description><![CDATA[Given amxnmatrix, if an element is 0, set its entire row and column to 0. Do itin-place.

Example 1:


Input: 
[
 [1,1,1],
 [1,0,1],
 [1,1,1]
]
Output: 
[
 [1,0,1],
 [0,0,0],
 [1,0,1]
]


...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [7]: 64. Minimum Path Sum]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103586616</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103586616</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 19:56:49 +0800</pubDate><description><![CDATA[Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.

Note:You can only move either down or right at ...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [6]: 63. Unique Paths II]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103586434</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103586434</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 19:45:01 +0800</pubDate><description><![CDATA[A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the b...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [5]: 62. Unique Paths]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103586073</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103586073</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 19:34:21 +0800</pubDate><description><![CDATA[A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the b...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [4]: 61. Rotate List]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103585884</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103585884</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 19:07:57 +0800</pubDate><description><![CDATA[Example 1:


Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, k = 2
Output: 4-&gt;5-&gt;1-&gt;2-&gt;3-&gt;NULL
Explanation:
rotate 1 steps to the right: 5-&gt;1-&gt;2-&gt;3-&gt;4-&gt;NULL
rotate 2 steps to...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [3]: 60. Permutation Sequence]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103585559</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103585559</guid><author>cyr429</author><pubDate>Tue, 17 Dec 2019 18:41:48 +0800</pubDate><description><![CDATA[The set[1,2,3,...,n]contains a total ofn! unique permutations.

By listing and labeling all of the permutations in order, we get the following sequence forn= 3:

"123"
	"132"
	"213"
	"231"
	"312...]]></description><category></category></item><item><title><![CDATA[LeetCode in Java [2]: 59. Spiral Matrix II]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103568793</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103568793</guid><author>cyr429</author><pubDate>Mon, 16 Dec 2019 19:47:25 +0800</pubDate><description><![CDATA[Given a positive integern, generate a square matrix filled with elements from 1 ton2in spiral order.

Example:


Input: 3
Output:
[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]


设置上下左右四个限制器就行，结束标志是...]]></description><category></category></item><item><title><![CDATA[LeetCode in java [1]: 56. Merge Intervals]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103568454</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103568454</guid><author>cyr429</author><pubDate>Mon, 16 Dec 2019 19:29:14 +0800</pubDate><description><![CDATA[Given a collection of intervals, merge all overlapping intervals.

Example 1:


Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlap...]]></description><category></category></item><item><title><![CDATA[从零开始的LC刷题(134): Spiral Matrix]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103091719</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103091719</guid><author>cyr429</author><pubDate>Fri, 15 Nov 2019 20:16:30 +0800</pubDate><description><![CDATA[原题；


Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.

Example 1:


Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output: [1,2,3,6,9,8,7,...]]></description><category></category></item><item><title><![CDATA[从零开始的LC刷题(133): Pow(x, n)]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103091241</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103091241</guid><author>cyr429</author><pubDate>Fri, 15 Nov 2019 19:37:35 +0800</pubDate><description><![CDATA[原题：


Implementpow(x,n), which calculatesxraised to the powern(xn).

Example 1:


Input: 2.00000, 10
Output: 1024.00000


Example 2:


Input: 2.10000, 3
Output: 9.26100


Example 3:


Input: 2.0...]]></description><category></category></item><item><title><![CDATA[【机器学习】讨论SGD，BGD和牛顿法在逻辑回归中的效果]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103090851</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103090851</guid><author>cyr429</author><pubDate>Fri, 15 Nov 2019 19:14:14 +0800</pubDate><description><![CDATA[因为随机梯度下降，批梯度下降和牛顿法都可以用在线性回归中，所以想比较一下三者的效果。

原理：

SGD，BGD：https://blog.youkuaiyun.com/cyr429/article/details/102300105

牛顿法：https://blog.youkuaiyun.com/cyr429/article/details/102624860

先放出来原数据的散点图：



需要原数据的：http...]]></description><category></category></item><item><title><![CDATA[【CS229机器学习】 Lecture7：最优裕度分类器（最优间隔分类器），拉格朗日对偶，KKT条件，SVM支持向量机]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103085578</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103085578</guid><author>cyr429</author><pubDate>Fri, 15 Nov 2019 18:02:51 +0800</pubDate><description><![CDATA[接上次：https://blog.youkuaiyun.com/cyr429/article/details/103008203

4. 最优裕度分类器-上

给出一组训练集，基于之前的讨论我们很自然的会去找一个决策边界线使得几何裕度最大，因为这样的决策线体现了我们对于分类的信心很强同时也是原数据很好的拟合。这样做的结果是一个用沟壑把正样本和负样本分开的分类器。

目前我们先假设数据是线性可分的，也就是数据一...]]></description><category></category></item><item><title><![CDATA[从零开始的LC刷题(132): Rotate Image]]></title><link>https://blog.youkuaiyun.com/cyr429/article/details/103015334</link><guid>https://blog.youkuaiyun.com/cyr429/article/details/103015334</guid><author>cyr429</author><pubDate>Mon, 11 Nov 2019 19:03:44 +0800</pubDate><description><![CDATA[原题：


You are given annxn2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

Note:

You have to rotate the imagein-place, which means you have to modify the input 2D ma...]]></description><category></category></item></channel></rss>