ljz2015301785的博客

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def isPalindrome(self, head: ListNode) -> bool: cur = head result = [] whi.

# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode: curA = hea...

class Solution: def countBits(self, n: int) -> List[int]: result = [] for i in range(0,n+1): result.append(list(bin(i)).count("1")) return result

class Solution: def smallestDifference(self, a: List[int], b: List[int]) -> int: a.sort() b.sort() result = 2147483647 i = 0 j = 0 while (i < len(a) and j < len(b)): result = min(r...

class Solution: def CheckPermutation(self, s1: str, s2: str) -> bool: if len(s1) > len(s2): sum = s1 else: sum = s2 for i in sum: #print(i) if ...

class Solution: def isUnique(self, astr: str) -> bool: for i in astr: if astr.count(i) == 1: continue else: return False return True