<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ivanmerlin的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ivanmerlin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ivanmerlin]]></copyright><item><title><![CDATA[Single Number]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48825707</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48825707</guid><author>ivanmerlin</author><pubDate>Wed, 30 Sep 2015 10:13:03 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. Find that single one.

大意就是，别的数字都成双成对，只有一个数字孤身一人。【别名：寻找单身狗】

Note:

Your algorithm should have a linear runtime complexity]]></description><category></category></item><item><title><![CDATA[Remove Element 100%哟]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48521471</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48521471</guid><author>ivanmerlin</author><pubDate>Thu, 17 Sep 2015 14:31:05 +0800</pubDate><description><![CDATA[Given an array and a value, remove all instances of that value in place and return the new length.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

这]]></description><category></category></item><item><title><![CDATA[Reverse Linked List 翻转链表]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48506083</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48506083</guid><author>ivanmerlin</author><pubDate>Wed, 16 Sep 2015 23:42:23 +0800</pubDate><description><![CDATA[Reverse a singly linked list.
单向链表是个难点。
一开始用栈来做，结果报了内存超过了。
后来想到用指针来做。
保存第二个元素的下一个节点，让他们依次反序指向即可




/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *]]></description><category></category></item><item><title><![CDATA[Majority Element]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48503067</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48503067</guid><author>ivanmerlin</author><pubDate>Wed, 16 Sep 2015 22:10:28 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48502631</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48502631</guid><author>ivanmerlin</author><pubDate>Wed, 16 Sep 2015 21:49:30 +0800</pubDate><description><![CDATA[Related to question Excel Sheet Column Title

Given a column title as appear in an Excel sheet, return its corresponding column number.

For example:
    A -> 1
    B -> 2
    C -> 3
    ...
    ]]></description><category></category></item><item><title><![CDATA[最长单词]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48370019</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48370019</guid><author>ivanmerlin</author><pubDate>Fri, 11 Sep 2015 11:12:50 +0800</pubDate><description><![CDATA[给一个词典，找出其中所有最长的单词


样例

在词典
{
  "dog",
  "google",
  "facebook",
  "internationalization",
  "blabla"
}

中, 最长的单词集合为 ["internationalization"]
在词典
{
  "like",
  "love",
  "hate",
  "yes"
}

中]]></description><category></category></item><item><title><![CDATA[翻转二叉树]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48369173</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48369173</guid><author>ivanmerlin</author><pubDate>Fri, 11 Sep 2015 10:30:12 +0800</pubDate><description><![CDATA[样例

  1         1
 / \       / \
2   3  => 3   2
   /       \
  4         4





通常使用递归的办法
public class Solution {
    /**
     * @param root: a TreeNode, the root of the binary tree
     * @]]></description><category></category></item><item><title><![CDATA[O(1)检测2的幂次]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48368537</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48368537</guid><author>ivanmerlin</author><pubDate>Fri, 11 Sep 2015 09:53:53 +0800</pubDate><description><![CDATA[用 O(1)
 时间检测整数 n 是否是 2 的幂次。


这个问题一开始我是想用求Log的方法算
 public static boolean checkPowerOf2(int n) {
        // write your code here
        if(n<=0) return false;
        double answer=Math.log(n)/Ma]]></description><category></category></item><item><title><![CDATA[乱序字符串]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48342595</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48342595</guid><author>ivanmerlin</author><pubDate>Thu, 10 Sep 2015 14:05:31 +0800</pubDate><description><![CDATA[给出一个字符串数组S，找到其中所有的乱序字符串(Anagram)。如果一个字符串是乱序字符串，那么他存在一个字母集合相同，但顺序不同的字符串也在S中。


样例

对于字符串数组 ["lint","intl","inlt","code"]
返回 ["lint","inlt","intl"]



注意

所有的字符串都只包含小写字母


先生成每个字符串的标识，即字母]]></description><category></category></item><item><title><![CDATA[比较两个字符串A和B，确定A中是否包含B中所有的字符。]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/48315349</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/48315349</guid><author>ivanmerlin</author><pubDate>Wed, 09 Sep 2015 14:08:35 +0800</pubDate><description><![CDATA[如题

样例

给出 A = "ABCD" B
 = "ACD"，返回 true
给出 A = "ABCD" B
 = "AABC"， 返回 false



注意

在 A 中出现的 B 字符串里的字符不需要连续或者有序。




目前思路是分别扫描两个字符串得到两个map 比较字母出现次数，若A的每个字母次数都>=B ， 则成立。同理 判断是否互为变位词也可]]></description><category></category></item><item><title><![CDATA[JAVA GUI PART1 记事本程序 极其简易版]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/18775217</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/18775217</guid><author>ivanmerlin</author><pubDate>Sat, 25 Jan 2014 21:21:25 +0800</pubDate><description><![CDATA[JMenuBar 菜单栏
JMenu 菜单项
JMenuItem 菜单项弹出来的子菜单项


FileDialog 用来访问本地文件的对话框 (frame,string,int)
以下为建议修改版记事本
import java.awt.EventQueue;


public class Textbook {

	private JFrame frame;
	JMenu mnFile]]></description><category></category></item><item><title><![CDATA[今天开始学JAVA]]></title><link>https://blog.youkuaiyun.com/ivanmerlin/article/details/8646443</link><guid>https://blog.youkuaiyun.com/ivanmerlin/article/details/8646443</guid><author>ivanmerlin</author><pubDate>Thu, 07 Mar 2013 18:57:46 +0800</pubDate><description><![CDATA[新学期开始了。。告别了C开始迎接JAVA，没想到光是一个输入数字问题就把我纠结了半天，网上的方法实在是太多了，我就稍微整理一下自己看到的方便我自己以后查吧- -!...


1、   使用标准输入串对象System.in
System.in.read()
返回该字节数据的ascii码 其实我觉得不太好用啊= =


2、 利用 Scanner 实现从键盘读入integer或floa]]></description><category></category></item></channel></rss>