<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Felomeng的技术博客]]></title><description><![CDATA[一个旅居美国程序员的心路历程]]></description><link>https://blog.csdn.net/felomeng</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; felomeng]]></copyright><item><title><![CDATA[从旧博客出发，向新的世界走去]]></title><link>https://blog.csdn.net/felomeng/article/details/161756245</link><guid>https://blog.csdn.net/felomeng/article/details/161756245</guid><author>felomeng</author><pubDate>Sun, 07 Jun 2026 01:13:39 +0800</pubDate><description><![CDATA[这篇文章是对旧博客的一次告别与交代。
自 2015 年来到美国后，生活与工作的节奏改变，中文博客的更新逐渐减少，但它记录了我从学生到工程师的技术成长与写作习惯。
如今，我重新开始系统化写作，内容将以大语言模型、系统设计和工程实践为主，并主要发布在新的英文个人网站 www.noahhan.com。
旧博客会继续保留作为个人档案，而新的写作将在新的地方继续。]]></description><category></category></item><item><title><![CDATA[weka入门教程II——分类]]></title><link>https://blog.csdn.net/felomeng/article/details/104692015</link><guid>https://blog.csdn.net/felomeng/article/details/104692015</guid><author>felomeng</author><pubDate>Fri, 06 Mar 2020 11:46:38 +0800</pubDate><description><![CDATA[读研时转过一篇《weka入门教程》。当时机器学习还没有这么火。Weka其实非常方便，有图形界面，可以识别多种格式，自动切分测试集与训练集等功能。这篇主要介绍图形界面下分类的用法，其他机器学习任务大同小异。

weka可以从官方网站下载：https://www.cs.waikato.ac.nz/ml/weka/

安装就不说了，安装好后运行，Windows在菜单中可以找到，Linux运行weka.s...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-034]]></title><link>https://blog.csdn.net/felomeng/article/details/103160589</link><guid>https://blog.csdn.net/felomeng/article/details/103160589</guid><author>felomeng</author><pubDate>Wed, 20 Nov 2019 13:08:55 +0800</pubDate><description><![CDATA[Search for a Range Medium

Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the o...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-033]]></title><link>https://blog.csdn.net/felomeng/article/details/103160557</link><guid>https://blog.csdn.net/felomeng/article/details/103160557</guid><author>felomeng</author><pubDate>Wed, 20 Nov 2019 13:05:32 +0800</pubDate><description><![CDATA[Search in Rotated Sorted Array Medium

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).

You are giv...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-032]]></title><link>https://blog.csdn.net/felomeng/article/details/103140260</link><guid>https://blog.csdn.net/felomeng/article/details/103140260</guid><author>felomeng</author><pubDate>Tue, 19 Nov 2019 13:27:21 +0800</pubDate><description><![CDATA[Longest Valid Parentheses Hard

Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.

For"(()", the longest valid pa...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-031]]></title><link>https://blog.csdn.net/felomeng/article/details/103120168</link><guid>https://blog.csdn.net/felomeng/article/details/103120168</guid><author>felomeng</author><pubDate>Mon, 18 Nov 2019 11:57:55 +0800</pubDate><description><![CDATA[Next Permutation Medium

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-030]]></title><link>https://blog.csdn.net/felomeng/article/details/102850402</link><guid>https://blog.csdn.net/felomeng/article/details/102850402</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:44:06 +0800</pubDate><description><![CDATA[Substring with Concatenation of All Words Hard

You are given a string,s, and a list of words,words, that are all of the same length. Find all starting indices of substring(s) insthat is a conc...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-029]]></title><link>https://blog.csdn.net/felomeng/article/details/102850400</link><guid>https://blog.csdn.net/felomeng/article/details/102850400</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:43:25 +0800</pubDate><description><![CDATA[Divide Two Integers Medium

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.


public int divide(int dividend, int divisor) {

 if...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-028]]></title><link>https://blog.csdn.net/felomeng/article/details/102850398</link><guid>https://blog.csdn.net/felomeng/article/details/102850398</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:42:51 +0800</pubDate><description><![CDATA[Implement strStr()Easy

Implement strStr().

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.


public int strStr(String haystack, String ne...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-027]]></title><link>https://blog.csdn.net/felomeng/article/details/102850397</link><guid>https://blog.csdn.net/felomeng/article/details/102850397</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:42:20 +0800</pubDate><description><![CDATA[Remove Element Easy

Given an array and a value, remove all instances of that value in place and return the new length.

Do not allocate extra space for another array, you must do this in place wit...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-026]]></title><link>https://blog.csdn.net/felomeng/article/details/102850396</link><guid>https://blog.csdn.net/felomeng/article/details/102850396</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:41:45 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted Array Easy

Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.

Do not allocate extra space for an...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-025]]></title><link>https://blog.csdn.net/felomeng/article/details/102850394</link><guid>https://blog.csdn.net/felomeng/article/details/102850394</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:41:04 +0800</pubDate><description><![CDATA[Reverse Nodes in k-Group Hard

Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.

kis a positive integer and is less than or equal to the length of ...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-024]]></title><link>https://blog.csdn.net/felomeng/article/details/102850391</link><guid>https://blog.csdn.net/felomeng/article/details/102850391</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:39:25 +0800</pubDate><description><![CDATA[Swap Nodes in Pairs Medium

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given1-&gt;2-&gt;3-&gt;4, you should return the list as2-&gt;1-&gt;4-&gt;3.

Your...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-023]]></title><link>https://blog.csdn.net/felomeng/article/details/102850390</link><guid>https://blog.csdn.net/felomeng/article/details/102850390</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:38:46 +0800</pubDate><description><![CDATA[Merge k Sorted Lists Hard

Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.


public ListNode mergeKLists(ListNode[] lists) {

 if (lists == nul...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-022]]></title><link>https://blog.csdn.net/felomeng/article/details/102850389</link><guid>https://blog.csdn.net/felomeng/article/details/102850389</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:38:17 +0800</pubDate><description><![CDATA[Generate Parentheses Medium

Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, givenn= 3, a solution set is:


[ "((()))",


 ...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-021]]></title><link>https://blog.csdn.net/felomeng/article/details/102850388</link><guid>https://blog.csdn.net/felomeng/article/details/102850388</guid><author>felomeng</author><pubDate>Fri, 01 Nov 2019 06:37:41 +0800</pubDate><description><![CDATA[Merge Two Sorted Lists Easy

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.


public ListNode mergeTwo...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-020]]></title><link>https://blog.csdn.net/felomeng/article/details/102811123</link><guid>https://blog.csdn.net/felomeng/article/details/102811123</guid><author>felomeng</author><pubDate>Wed, 30 Oct 2019 00:29:42 +0800</pubDate><description><![CDATA[Valid Parentheses Easy

Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.

The brackets must close in the correct order,"()"an...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-019]]></title><link>https://blog.csdn.net/felomeng/article/details/102811119</link><guid>https://blog.csdn.net/felomeng/article/details/102811119</guid><author>felomeng</author><pubDate>Wed, 30 Oct 2019 00:28:59 +0800</pubDate><description><![CDATA[Remove Nth Node From End of List Medium

Given a linked list, remove thenthnode from the end of list and return its head.

For example,


 Given linked list: 1-&gt;2-&gt;3-&gt;4-&gt;5, and n = ...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-018]]></title><link>https://blog.csdn.net/felomeng/article/details/102811114</link><guid>https://blog.csdn.net/felomeng/article/details/102811114</guid><author>felomeng</author><pubDate>Wed, 30 Oct 2019 00:27:46 +0800</pubDate><description><![CDATA[4Sum Medium

Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of target.

Note:...]]></description><category></category></item><item><title><![CDATA[LeetCode Java First 400 题解-017]]></title><link>https://blog.csdn.net/felomeng/article/details/102811107</link><guid>https://blog.csdn.net/felomeng/article/details/102811107</guid><author>felomeng</author><pubDate>Wed, 30 Oct 2019 00:26:55 +0800</pubDate><description><![CDATA[Letter Combinations of a Phone Number Medium

Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telepho...]]></description><category></category></item></channel></rss>