<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jock的博客]]></title><description><![CDATA[无他，唯手熟尔。]]></description><link>https://blog.youkuaiyun.com/wangchinlung</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wangchinlung]]></copyright><item><title><![CDATA[Leetcode-Python Pow(x, n)]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89480144</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89480144</guid><author>wangchinlung</author><pubDate>Tue, 23 Apr 2019 20:13:31 +0800</pubDate><description><![CDATA[class Solution:
    def myPow(self, x: float, n: int) -&gt; float:
        if n == 0:
            return 1
        elif n % 2 != 0:
            if n &gt; 0:
                return x*self.myPow(x,n-...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 移除元素]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89480045</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89480045</guid><author>wangchinlung</author><pubDate>Tue, 23 Apr 2019 20:09:03 +0800</pubDate><description><![CDATA[class Solution:
    def removeElement(self, nums: List[int], val: int) -&gt; int:
        for i in range(len(nums)-1,-1,-1):
            if nums[i] == val:
                nums.pop(i)
        ret...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89479808</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89479808</guid><author>wangchinlung</author><pubDate>Tue, 23 Apr 2019 19:58:19 +0800</pubDate><description><![CDATA[class Solution:
    def letterCombinations(self, digits: str) -&gt; [str]:
        dirc = {'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        result = []
   ...]]></description><category></category></item><item><title><![CDATA[用于推荐的异构信息网络嵌入方法Heterogeneous Information Network Embedding for Recommendation]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89466972</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89466972</guid><author>wangchinlung</author><pubDate>Tue, 23 Apr 2019 10:11:09 +0800</pubDate><description><![CDATA[这是发表在IEEE2019年的论文。
作者：Chuan Shi, Member, IEEE, Binbin Hu, Wayne Xin Zhao Member, IEEE and Philip S. Yu, Fellow, IEEE

Abstract
​		异构信息网络已经在推荐系统中用于表征复杂、异构的数据。基于HIN的推荐是指抽取、开发HIN中的信息。之前的HIN的推荐大多是基于路径相似，...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 最接近的三数之和]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89437770</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89437770</guid><author>wangchinlung</author><pubDate>Sun, 21 Apr 2019 19:35:59 +0800</pubDate><description><![CDATA[class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -&gt; int:
        nums.sort()
        minX = 10000
        result = 0
        for i in range(len(nums)-2):
            l...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 三数之和]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89437748</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89437748</guid><author>wangchinlung</author><pubDate>Sun, 21 Apr 2019 19:35:01 +0800</pubDate><description><![CDATA[class Solution:
    def threeSum(self, nums: List[int]) -&gt; List[List[int]]:
        result = []
        nums.sort()
        for i in range(len(nums)-2):
            if nums[i] &gt; nums[i-1] or ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89437726</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89437726</guid><author>wangchinlung</author><pubDate>Sun, 21 Apr 2019 19:33:55 +0800</pubDate><description><![CDATA[class Solution:
    def longestCommonPrefix(self, strs: List[str]) -&gt; str:
        
        string = ''
        if len(strs) != 0:
            string = min(strs,key = lambda s:len(s))
        en...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89437697</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89437697</guid><author>wangchinlung</author><pubDate>Sun, 21 Apr 2019 19:32:33 +0800</pubDate><description><![CDATA[class Solution:
    def romanToInt(self, s: str) -&gt; int:
        tempA = {'IV':4,'IX':9,'XL':40,'XC':90,'CD':400,'CM':900,}
        tempB = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500, 'M':1000,}...]]></description><category></category></item><item><title><![CDATA[异构图注意力网络 Heterogeneous Graph Attention Network]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89385368</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89385368</guid><author>wangchinlung</author><pubDate>Thu, 18 Apr 2019 18:44:46 +0800</pubDate><description><![CDATA[​​​​​​​​​​# Heterogeneous Graph Attention Network
文章目录ABSTRACTKEYWORDSINTRODUCTIONRELATED WORKGraph Neural NetworkNetwork EmbeddingPRELIMINARYTHE PROPOSED MODELNode-level AttentionSemantic-level Atten...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 整数转罗马数字]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89374798</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89374798</guid><author>wangchinlung</author><pubDate>Thu, 18 Apr 2019 11:20:02 +0800</pubDate><description><![CDATA[class Solution:
    def intToRoman(self, num: int) -&gt; str:
        string = str(num)
        result = ''
        length = len(string)
        for s in range(length):
            e_num = int(st...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 盛最多水的容器]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89349818</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89349818</guid><author>wangchinlung</author><pubDate>Wed, 17 Apr 2019 09:48:14 +0800</pubDate><description><![CDATA[class Solution:
    def maxArea(self, height: [int]) -&gt; int:
        area = 0
        y = len(height)-1
        x = 0
        while x != y:
            a = min(height[y],height[x]) * abs(x-y)
  ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 回文数]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341798</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341798</guid><author>wangchinlung</author><pubDate>Wed, 17 Apr 2019 09:04:36 +0800</pubDate><description><![CDATA[class Solution:
    def isPalindrome(self, x: int) -&gt; bool:
        return str(x) == str(x)[::-1]

github项目地址：https://github.com/JockWang/LeetCode-Python
]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 字符串转换整数（atoi）]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341772</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341772</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:49:52 +0800</pubDate><description><![CDATA[class Solution:
    def myAtoi(self, s: str) -&gt; int:
        s = s.strip(' ')
        string = '0'
        if len(s) &gt; 0:
            if s[0] == '-' or s[0].isdigit() or s[0] == '+':
      ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python  整数反转]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341714</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341714</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:47:47 +0800</pubDate><description><![CDATA[class Solution:
    def reverse(self, x: int) -&gt; int:
        if x &lt; -2**31 or x &gt; 2**31-1:
            return 0
        if x &gt;= 0:
            res = int(str(x)[::-1])
        else:
   ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python Z 字形变换]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341700</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341700</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:46:16 +0800</pubDate><description><![CDATA[class Solution:
    def convert(self, s: str, numRows: int) -&gt; str:
        string = ''
        edge = 2*(numRows-1)
        if edge == 0 or len(s) &lt;= numRows:
            return s
        cu...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 最长回文子串]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341646</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341646</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:44:51 +0800</pubDate><description><![CDATA[class Solution:
    def longestPalindrome(self, s: str) -&gt; str:
        res = ''
        temp = {}
        if len(s) &gt; 0:
            res = s[0]
        for i in range(len(s)):
            if...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 寻找两个有序数组的中位数]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341602</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341602</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:43:21 +0800</pubDate><description><![CDATA[class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -&gt; float:
            temp = nums1+nums2
            temp.sort()
            if len(temp)%2 == 0:
       ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341578</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341578</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:42:11 +0800</pubDate><description><![CDATA[class Solution:
    def lengthOfLongestSubstring(self, s: str) -&gt; int:
        memary = {}
        best,temp = 0,0
        for i in range(len(s)):
            if s[i] in memary:
                ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 两数相加]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341553</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341553</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:40:29 +0800</pubDate><description><![CDATA[# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ...]]></description><category></category></item><item><title><![CDATA[Leetcode-Python 两数之和]]></title><link>https://blog.youkuaiyun.com/wangchinlung/article/details/89341493</link><guid>https://blog.youkuaiyun.com/wangchinlung/article/details/89341493</guid><author>wangchinlung</author><pubDate>Tue, 16 Apr 2019 20:38:33 +0800</pubDate><description><![CDATA[class Solution:
    def twoSum(self, nums: List[int], target: int) -&gt; List[int]:
        for key,value in enumerate(nums):
            another = target-value
            if another in nums:
    ...]]></description><category></category></item></channel></rss>