yexx
yexx_个人页
yexx
文章
308
问答
0
视频
0
个人介绍
CSDN博客地址---http://blog.csdn.net/bug_moving GitHub地址---https://github.com/androidwolf
擅长的技术
-
发表了文章 2016-10-19
【Python】TypeError: 'module' object is not callable 原因分析
**原因分析： Python导入模块的方法有两种：import module 和 from module import，区别是前者所有导入的东西使用时需加上模块名的限定，而后者不要。** from bs4 import BeautifulSoup markup = "<b><!--Hey, buddy. Want to buy a used parse
-
发表了文章 2016-10-18
[LeetCode]--5. Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 我用的是中心扩展法 因为
-
发表了文章 2016-10-18
[LeetCode]--415. Add Strings
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2. Note: The length of both num1 and num2 is < 5100. Both num1 and num2 contains only
-
发表了文章 2016-10-18
[LeetCode]--412. Fizz Buzz
Write a program that outputs the string representation of numbers from 1 to n. But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output
-
发表了文章 2016-10-18
[LeetCode]--409. Longest Palindrome
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This is case sensitive, for example “Aa” i
-
发表了文章 2016-10-18
[LeetCode]--405. Convert a Number to Hexadecimal
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used. Note: All letters in hexadecimal (a-f) must be in lowercase. The
-
发表了文章 2016-10-17
[LeetCode]--404. Sum of Left Leaves
Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 15 respective
-
发表了文章 2016-10-17
[LeetCode]--401. Binary Watch（递归有点懵）
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents a zero or one, with the least signific
-
发表了文章 2016-10-17
[LeetCode]--400. Nth Digit
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, … Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231). Exampl
-
发表了文章 2016-10-17
[LeetCode]--396. Rotate Function
Given an array of integers A and let n to be its length. Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a “rotation function” F on A as follow:
-
发表了文章 2016-10-17
[LeetCode]--389. Find the Difference
Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the letter th
-
发表了文章 2016-10-17
[LeetCode]--387. First Unique Character in a String
Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Not
-
发表了文章 2016-10-17
[LeetCode]--383. Ransom Note
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can
-
发表了文章 2016-10-17
[LeetCode]--374. Guess Number Higher or Lower
We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I’ll tell you whether the number i
-
发表了文章 2016-10-16
[LeetCode]--371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. Credits: Special thanks to @fujiaozhu for addin
-
发表了文章 2016-10-16
[LeetCode]--350. Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2]. Note: Each element in the result should appear as m
-
发表了文章 2016-10-16
[LeetCode]--349. Intersection of Two Arrays
Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element in the result must be unique. The
-
发表了文章 2016-10-16
[LeetCode]--345. Reverse Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string. Example 1: Given s = “hello”, return “holle”. Example 2: Given s = “leetcode”, return “leotcede”.
-
发表了文章 2016-10-16
[LeetCode]--344. Reverse String
Write a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”. public String reverseString(String s) { char[] ss = s.t
-
发表了文章 2016-10-16
[LeetCode]--342. Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could you solve it
-
发表了文章 2016-10-16
[LeetCode]--326. Power of Three
Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion? Credits: Special thanks to @dietpepsi for addin
-
发表了文章 2016-10-16
Java Math的floor，round，ceil函数小结
floor 返回不大于的最大整数 round 则是4舍5入的计算，入的时候是到大于它的整数（当-1.5时可见，四舍五入后得到的结果不是我们期待的，解决办法是先对他取绝对值，然后在用round方法） round方法，它表示“四舍五入”，算法为Math.floor(x+0.5)，即将原来的数字加上0.5后再向下取整，所以，Math.round(11.5)的结果为12，Mat
-
发表了文章 2016-10-16
[LeetCode]--303. Range Sum Query - Immutable
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) -&
-
发表了文章 2016-10-16
[LeetCode]--299. Bulls and Cows
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
-
发表了文章 2016-10-16
[LeetCode]--292. Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone
-
发表了文章 2016-10-16
[LeetCode]--290. Word Pattern
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 s
-
发表了文章 2016-10-16
[LeetCode]--283. 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. For example, given nums = [0, 1, 0, 3, 12], after call
-
发表了文章 2016-10-16
[LeetCode]--278. First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed b
-
发表了文章 2016-10-14
[LeetCode]--263. Ugly Number
Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ug
-
发表了文章 2016-10-14
[LeetCode]--258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has o
-
发表了文章 2016-10-14
[LeetCode]--257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: [“1->2->5”, “1->3”] C
-
发表了文章 2016-10-14
[LeetCode]--242. Valid Anagram
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
-
发表了文章 2016-10-14
[LeetCode]--237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the thi
-
发表了文章 2016-10-14
[LeetCode]--235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defin
-
发表了文章 2016-10-13
[LeetCode]--234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space? 我的思路很简单，先遍历一遍找到长度，然后用堆保存着前面一半的数据然后与后面的对比，不一样就false。 /** * Definitio
-
发表了文章 2016-10-13
[LeetCode]--232. Implement Queue using Stacks
Implement the following operations of a queue using stacks. push(x) – Push element x to the back of queue. pop() – Removes the element from in front of queue. peek() – Get the front elem
-
发表了文章 2016-10-13
[LeetCode]--231. Power of Two
Given an integer, write a function to determine if it is a power of two. Credits: Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases. 如果是power of
-
发表了文章 2016-10-13
[LeetCode]--226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original twe
-
发表了文章 2016-10-13
[LeetCode]--225. Implement Stack using Queues
Implement the following operations of a stack using queues. push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get the top element. empty() –
-
发表了文章 2016-10-11
[LeetCode]--223. Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure. Rectangle Area
-
发表了文章 2016-10-11
[LeetCode]--219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k
-
发表了文章 2016-10-11
[LeetCode]--217. Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every
-
发表了文章 2016-10-11
[LeetCode]--206. Reverse Linked List
Reverse a singly linked list. click to show more hints. Hint: A linked list can be reversed either iteratively or recursively. Could you implement both? 贴个递归代码，一次Accept。 public ListN
-
发表了文章 2016-10-11
[LeetCode]--205. Isomorphic Strings（同构字符串）
Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced wi
-
发表了文章 2016-10-11
[LeetCode]--203. Remove Linked List Elements
Remove all elements from a linked list of integers that have value val. Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –>
-
发表了文章 2016-10-10
[LeetCode]--202. 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 th
-
发表了文章 2016-10-10
class path resource [META-INF/xfire/services.xml] cannot be opened because it does not exist
如图所示，错误就是找不到那个service.xml 但是仔细找找，那个文件确确实实躺在那儿的。 那是什么原因了，别人告诉我这个要看Class path。 System.getProperty("java.class.path") 用这个可以得到class path 。 解决方案就是把META-INF那个文件夹拖到WEB-INF这个文件夹下面来才可以被
-
发表了文章 2016-10-10
Unrecognized xbean element mapping: beans in namespace http://xfire.codehaus.org/config/1.0
原因是因为xfire中内嵌的是spring1.2.8，而spring的1.X与2.X之间命名空间的方式改变了… 解决方式： 将原来的文件如下 <beans xmlns="http://xfire.codehaus.org/config/1.0"> <service> </service> </beans>
-
发表了文章 2016-10-10
关于Eclipse中内存溢出问题和jar包导入问题
我昨天晚上导入XFire的jar包之后，点了Ctrl加那个类，想看看我是否导入成功，结果eclipse就卡死了。 这个问题其实很常见，是内存溢出了，那么怎么解决。 先找到同目录下的eclipse.ini文件 然后编辑修改，现在根本不缺内存，可以给它分配多一点。 紧接着我再次按着Ctrl点击进入，这次没有卡顿，但是出现新问题。 其实这并不是问题，只是这个ja
-
发表了文章 2016-10-10
Tomcat启动时报错：“ Error starting static Resources”问题解决
对于这个问题，我纠结了好几天，后来才明白是由于什么原因引起的，下面将我的解决办法分享下来。 一般来说出现这种错误是由于你在MyEclipse或Eclipse中删除了某个项目后，没有将Tomcat-6.x\conf\server.xml相关修改完全，才影起了这个问题，那么要怎么解决了？ 解决办法： 第一步 清空Tomcat-6.x目录下的work目录； 第
暂无更多信息
-
发表了文章
2017-03-03
如何捕获java线程中的逃逸的异常
-
发表了文章
2017-03-02
我的博客即将入驻“云栖社区”，诚邀技术同仁一同入驻。
-
发表了文章
2017-02-24
netty入门小程序
-
发表了文章
2017-02-24
Java单链表归并排序
-
发表了文章
2017-02-23
Java单链表实现快速排序
-
发表了文章
2017-02-19
自用Markdown颜色字体代码
-
发表了文章
2017-02-19
Java动态代理的两种实现方法
-
发表了文章
2017-02-19
synchronized 修饰在 static方法和非static方法的区别
-
发表了文章
2017-02-17
多线程中基础Thread和实现Runnable的区别
-
发表了文章
2017-02-14
剑指offer 面试题6—重建二叉树
-
发表了文章
2017-02-14
剑指offer 面试题5—从尾到头打印链表
-
发表了文章
2017-02-14
剑指offer 面试题4—替换字符串中空格
-
发表了文章
2017-02-14
剑指offer 面试题3—二维数组中找数
-
发表了文章
2017-02-14
剑指offer 面试题2—实现单例模式
-
发表了文章
2017-02-12
《HTTP详解》三部曲
-
发表了文章
2017-02-12
面试常见查询语句（能掌握以下几个例子就基本可以了）
-
发表了文章
2017-02-12
MySQL性能优化——易实现的MySQL优化方案汇总
-
发表了文章
2017-02-11
HashMap Hashtable区别
-
发表了文章
2017-02-09
高并发服务端分布式系统设计概要（下）
-
发表了文章
2017-02-09
高并发服务端分布式系统设计概要（中）
滑动查看更多
暂无更多信息
暂无更多信息