Skip to content

Commit bc457be

Browse files
YujueYYujueY
committed
作业
1 parent 40f8537 commit bc457be

11 files changed

Lines changed: 70 additions & 0 deletions

File tree

‎.idea/.gitignore‎

Lines changed: 3 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/algorithm010.iml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/inspectionProfiles/profiles_settings.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/misc.xml‎

Lines changed: 4 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/modules.xml‎

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/vcs.xml‎

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎Week08/1122.py‎

Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
class Solution:
2+
def relativeSortArray(self, arr1: List[int], arr2: List[int]) -> List[int]:
3+
dic = {}
4+
not_arry = []
5+
for i in range(len(arr1)):
6+
dic[arr1[i]] = dic.get(arr1[i], 0) + 1
7+
if arr1[i] not in arr2:
8+
not_arry.append(arr1[i])
9+
not_arry.sort()
10+
11+
new_arr1 = []
12+
arr1 = set(arr1)
13+
for j in range(len(arr2)):
14+
new_arr1 += [arr2[j]] * dic[arr2[j]]
15+
return new_arr1 + not_arry

‎Week08/146.py‎

Whitespace-only changes.

‎Week08/191.py‎

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
class Solution:
2+
def hammingWeight(self, n: int) -> int:
3+
res = 0
4+
while(n!=0):
5+
n &= n-1
6+
res+=1
7+
return res

‎Week08/242.py‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
class Solution:
2+
def isAnagram(self, s: str, t: str) -> bool:
3+
if len(s) != len(t): return False
4+
return sorted(s) == sorted(t)

0 commit comments

Comments
 (0)