Leet Code 刷题笔记 - - 不求最快最省，但求最短最优雅，Shorter is better here.

elegant leetcode leetcode-python leetcode-solutions python python3 shortest

shortest-leetcode-python-solutions's People

Contributors

Stargazers

Watchers

Forkers

dayelang bxgo yechong316 tlwzzy chengpeng15 zikobe jimmyxiaodong zouhao8534 ahaoboy mahsiaoko zjh1234562 ncepuchris wky-ly dmndxld maoshuyi alan-mars jxq0819 liuriver123 nicholashuai suningya123 airob domyslavy buyabighouse jiuweiw genggao110 qazwsx74269 kungwanyi rickyaimar lzhan011 qianfance bijibing rukawa-24 lrjxaint lakersdavis sunsky paulxin001 liangzhenm 985479701 shihaimingtian leoduan0406 arsming276 buerlee tobknight weibit piseyyou jacqueline-a-shay huibaobao bending96 miaotxy zjkliyingda hyj1116 lipq525 charlesko123 h002 joseph-mutu wszpfwszpf xmuzxt jinyuking bubblereset hhttss999 305538436 moshuying ssurmic lonngxiang jeffery1927 grg909 chenwdyy crazyguitar lukaschen1986 starchase quxinge aiprogrammer cheaster062211 mistyyyy lidongdongbuaa dspcjy fakeruone xiangjunli hack-yao sharpgogogo sjia xiuyuma agouti0516 lhchrispaul3 fishj1 lebhoryi l6chen ab19a1l tonydandelion eecrazy qstt huuush justinnnlo joshuamanto zhufuhui jianxu95 lynnsunstudio changtingq timduu coroline

shortest-leetcode-python-solutions's Issues

414.两行Python写法

class Solution: def thirdMax(self, nums): nums = sorted(list(set(nums))) return (len(nums) < 3) * nums[-1] or nums[-3]

二维数组对角线遍历解析有点问题

如果对角线元素个数是偶数则应该把 temp 反转 有误，比如 3*8 的矩阵，后面的对角线元素个数都是3，那就一直不会翻转，这是不对的。
代码里面是根据 l 的奇偶性来判断是否反转，是正确的。

addTwoNumbers－shortest solution

def addTwoNumbers(l1, l2):

temp1 = int(''.join(map(str,l1[::-1])))

temp2 = int(''.join(map(str,l2[::-1])))

return (map(int,list(str(temp1+temp2)[::-1])))

用 3.8 新特性 := 可以简化一些

class Solution:
    def isPalindrome(self, x: int) -> bool:
        return (k:=str(x)) == k[::-1]

~~字符数好像还多了~~

my solution in 342. Power of Four one line and use math

class Solution:
    def isPowerOfFour(self, num: int) -> bool:
        return num > 0 and ((math.log10(num)/math.log10(4)) % 1) == 0

268. Missing Number fast 99.9%,memery 100% and oneline

class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        return sum(list(range(len(nums) + 1))) -  sum(nums)

this is my solution in 189. Rotate Array and easy to understand

class Solution(object):
    def rotate(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        nums[:] = nums[len(nums) - k:] + nums[:len(nums) - k]

33. Search in Rotated Sorted Array

class Solution:
def search(self, nums: List[int], target: int) -> int:
if target in nums:
return nums.index(target)
else:
return -1

66.加一个另外的写法

66题，写了一个另外的简单写法，没有用map函数
class Solution:
def plusOne(self, digits: List[int]) -> List[int]:
return [int(i) for i in str(int(str(digits)[1:-1].replace(',', '').replace(' ', '')) + 1)]

136 题可以更简

operator 库里有 xor 函数，不需要从 int 类里调

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        return reduce(xor, nums)

#58. 最后一个单词的长度

虽然很简单，但是还是想说下

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        return len(s.strip(' ').split(' ')[-1])

507. Perfect Number, use Look-up table method

class Solution:
    def checkPerfectNumber(self, num: int) -> bool:
        perfect = [6, 28, 496, 8128, 33550336, 8589869056, 137438691328, 2305843008139952128]
        if num in perfect:
            return True
        return False

cy69855522 / shortest-leetcode-python-solutions Goto Github PK

shortest-leetcode-python-solutions's People

Contributors

Stargazers

Watchers

Forkers

shortest-leetcode-python-solutions's Issues

Recommend Projects

Recommend Topics

Recommend Org