<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[YYlxid————Nothing is possible if not try～]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/YYlxid</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; YYlxid]]></copyright><item><title><![CDATA[网易传媒2017数据挖掘内推编程题]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/52263577</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/52263577</guid><author>YYlxid</author><pubDate>Sat, 20 Aug 2016 21:15:34 +0800</pubDate><description><![CDATA[藏宝图 
解题思路 
水题import java.util.Scanner;public class Main{
    public static void main(String []args){
        Scanner cin=new Scanner(System.in);
        while(cin.hasNext()){
            String a=cin.n]]></description><category></category></item><item><title><![CDATA[华为2017上机题(北京优招)]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/52263495</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/52263495</guid><author>YYlxid</author><pubDate>Sat, 20 Aug 2016 20:55:03 +0800</pubDate><description><![CDATA[挑大写字符 
解题思路 
水题import java.util.Scanner;public class Main{
    public static void main(String[]args){
        Scanner cin=new Scanner(System.in);
        while(cin.hasNext()){
            String str=ci]]></description><category></category></item><item><title><![CDATA[indeed2017校招在线编程题（网测）二]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51835654</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51835654</guid><author>YYlxid</author><pubDate>Wed, 06 Jul 2016 00:08:21 +0800</pubDate><description><![CDATA[A - 改行/Line Break 
解题思路 
水题import java.util.Scanner;public class Main{
    public static void main(String []args){
        Scanner cin=new Scanner(System.in);
        while(cin.hasNext()){]]></description><category></category></item><item><title><![CDATA[今日头条2017后端工程师实习生笔试题]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51433911</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51433911</guid><author>YYlxid</author><pubDate>Tue, 17 May 2016 10:05:57 +0800</pubDate><description><![CDATA[最大映射
  有 n 个字符串，每个字符串都是由 A-J 的大写字符构成。现在你将每个字符映射为一个 0-9 的数字，不同字符映射为不同的数字。这样每个字符串就可以看做一个整数，唯一的要求是这些整数必须是正整数且它们的字符串不能有前导零。现在问你怎样映射字符才能使得这些字符串表示的整数之和最大？ 
  输入描述:每组测试用例仅包含一组数据，每组数据第一行为一个正整数 n ， 接下来有 n 行，每行一]]></description><category></category></item><item><title><![CDATA[php错误：访问网页出现Forbidden you donnot have permission to access … on this server]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51234517</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51234517</guid><author>YYlxid</author><pubDate>Sun, 24 Apr 2016 17:15:23 +0800</pubDate><description><![CDATA[打开apache的httpd.conf配置文件，修改两个位置<Directory />
    AllowOverride none
    Require all denied
</Directory>修改为<Directory />
    AllowOverride none
 #   Require all denied
    allow from all
</Directory> <Di]]></description><category></category></item><item><title><![CDATA[303. Range Sum Query - Immutable]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51155203</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51155203</guid><author>YYlxid</author><pubDate>Thu, 14 Apr 2016 21:26:34 +0800</pubDate><description><![CDATA[Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example: 
Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1 
sumRange(2, 5) -> -1 
sumRange(0, 5]]></description><category></category></item><item><title><![CDATA[290. Word Pattern]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51154917</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51154917</guid><author>YYlxid</author><pubDate>Thu, 14 Apr 2016 20:53:38 +0800</pubDate><description><![CDATA[Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.Examples:]]></description><category></category></item><item><title><![CDATA[299. Bulls and Cows]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51154487</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51154487</guid><author>YYlxid</author><pubDate>Thu, 14 Apr 2016 19:56:23 +0800</pubDate><description><![CDATA[You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that]]></description><category></category></item><item><title><![CDATA[华为2016实习生上机题]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51147092</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51147092</guid><author>YYlxid</author><pubDate>Wed, 13 Apr 2016 21:45:29 +0800</pubDate><description><![CDATA[1、 
 
简单题，直接遍历一般即可。import java.util.Scanner;
 public class Main{
    public static void main(String []args){
        Scanner cin=new Scanner(System.in);
        String s;
        while(cin.hasNext()){]]></description><category></category></item><item><title><![CDATA[京东2016实习生在线编程题]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51108566</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51108566</guid><author>YYlxid</author><pubDate>Sat, 09 Apr 2016 23:53:23 +0800</pubDate><description><![CDATA[选举游戏 
解题思路 
不断寻找数组中的最大值，若最大值不是小东，则争取当前投票数最大的候选人1票，直到最大值为小东。这种方法耗时会比较久，但是对于n不是特别大的情况还是可以接受的。 
以下代码是100%通过。#include<iostream>
using namespace std;
int main(){
    int n;
    int a[105];
    while(cin>>n)]]></description><category></category></item><item><title><![CDATA[OutputStream源码分析]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51087675</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51087675</guid><author>YYlxid</author><pubDate>Thu, 07 Apr 2016 17:30:45 +0800</pubDate><description><![CDATA[OutputSream是一个抽象类，属于字节流的写。import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
 
/**
 * 该抽象类是所有字节输出流的超类。一个输出流接受输出字节并将它们发送到池里(sink)
 * 定义OutputStream的子类至少要实现写一个字节到输出流这个方法。
 *]]></description><category></category></item><item><title><![CDATA[InputSteam源码分析]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51087197</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51087197</guid><author>YYlxid</author><pubDate>Thu, 07 Apr 2016 16:52:29 +0800</pubDate><description><![CDATA[InputStream是一个抽象类，属于字节流的读取。/**
 * 该抽象类是所有字节输入流的超类。
 */
public abstract class InputStream implements Closeable {
 
        // 该变量用于确定在skip方法中使用的最大缓存数组大小。
    private static final int MAX_SKIP_BUFFER_SIZ]]></description><category></category></item><item><title><![CDATA[hihocoder 1288:Font Size--微软2016校园招聘4月在线笔试]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51083012</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51083012</guid><author>YYlxid</author><pubDate>Thu, 07 Apr 2016 09:42:33 +0800</pubDate><description><![CDATA[1288 : Font Size时间限制:10000ms 
单点时限:1000ms 
内存限制:256MB描述 
Steven loves reading book on his phone. The book he reads now consists of N paragraphs and the i-th paragraph contains ai characters.Steven want]]></description><category></category></item><item><title><![CDATA[hihocoder 1051 : 补提交卡]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51076034</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51076034</guid><author>YYlxid</author><pubDate>Wed, 06 Apr 2016 16:26:47 +0800</pubDate><description><![CDATA[1051 : 补提交卡时间限制:2000ms 
单点时限:1000ms 
内存限制:256MB描述 
小Ho给自己定了一个宏伟的目标：连续100天每天坚持在hihoCoder上提交一个程序。100天过去了，小Ho查看自己的提交记录发现有N天因为贪玩忘记提交了。于是小Ho软磨硬泡、强忍着小Hi鄙视的眼神从小Hi那里要来M张”补提交卡”。每张”补提交卡”都可以补回一天的提交，将原本没有提交程序的一天变成]]></description><category></category></item><item><title><![CDATA[hihocoder 1135：Magic Box]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51075214</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51075214</guid><author>YYlxid</author><pubDate>Wed, 06 Apr 2016 15:23:33 +0800</pubDate><description><![CDATA[1135 : Magic Box
描述 
The circus clown Sunny has a magic box. When the circus is performing, Sunny puts some balls into the box one by one. The balls are in three c]]></description><category></category></item><item><title><![CDATA[hihocoder 1197 : Give My Text Back]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/51066065</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/51066065</guid><author>YYlxid</author><pubDate>Tue, 05 Apr 2016 16:50:25 +0800</pubDate><description><![CDATA[1197 : Give My Text Back
hihocoder]]></description><category></category></item><item><title><![CDATA[242. Valid Anagram]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/50763017</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/50763017</guid><author>YYlxid</author><pubDate>Mon, 29 Feb 2016 08:31:03 +0800</pubDate><description><![CDATA[Given two strings s and t,write a function to determine if t is an anagram of s.
For example,
s ="anagram", t = "nagaram", return true.
s ="rat", t = "car", return false.
Note:
You may assume the]]></description><category></category></item><item><title><![CDATA[238. Product of Array Except Self]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/50763014</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/50763014</guid><author>YYlxid</author><pubDate>Mon, 29 Feb 2016 08:29:41 +0800</pubDate><description><![CDATA[Given an array of n integerswhere n > 1, nums, return an array output suchthat output[i] is
 equal to the product of all theelements of nums except nums[i].
Solve it withoutdivision and in O(n).
Fo]]></description><category></category></item><item><title><![CDATA[260. Single Number III]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/50747156</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/50747156</guid><author>YYlxid</author><pubDate>Fri, 26 Feb 2016 08:47:57 +0800</pubDate><description><![CDATA[Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice.
 Find the two elements that appear only once.
For example:
Given nums]]></description><category></category></item><item><title><![CDATA[Map之HashMap源码分析]]></title><link>https://blog.youkuaiyun.com/YYlxid/article/details/50740349</link><guid>https://blog.youkuaiyun.com/YYlxid/article/details/50740349</guid><author>YYlxid</author><pubDate>Thu, 25 Feb 2016 20:38:16 +0800</pubDate><description><![CDATA[public 
class HashMap
    extends AbstractMap
    implements Map, Cloneable, Serializable




HashMap继承自AbstractMap，实现了Map接口，有map的基本操作；实现了Cloneable接口，使得该类是可克隆的；实现了Serializable接口，说明该类支持序列化。Hash]]></description><category></category></item></channel></rss>