File tree Expand file tree Collapse file tree 3 files changed +35
-2
lines changed
0003.Longest Substring Without Repeating Characters
0421.Maximum XOR of Two Numbers in an Array Expand file tree Collapse file tree 3 files changed +35
-2
lines changed Original file line number Diff line number Diff line change
1
+ class Solution :
2
+ def lengthOfLongestSubstring (self , s : str ):
3
+ max = 0
4
+ length = len (s )
5
+ substr = ""
6
+ for i in range (0 , length ):
7
+ index = substr .find (s [i ])
8
+ if index > - 1 :
9
+ substr = substr [index + 1 :]
10
+ substr += s [i ]
11
+ max = (max if (max > len (substr )) else len (substr ))
12
+ return max
Original file line number Diff line number Diff line change
1
+ class Solution :
2
+ def findMaximumXOR (self , nums : List [int ]) -> int :
3
+ max = 0
4
+ mask = 0
5
+ for i in range (30 , - 1 , - 1 ):
6
+ current = 1 << i
7
+ # ๆๆ็ไบ่ฟๅถๅ็ผ
8
+ mask = mask ^ current
9
+ # ๅจๅฝๅๅ็ผไธ, ๆฐ็ปๅ
็ๅ็ผไฝๆฐๆๆๆ
ๅต้ๅ
10
+ _set = set ()
11
+ for num in nums :
12
+ _set .add (num & mask )
13
+ # ๆๆๆ็ปๅผๆๅผ็ไปๅณๆฐ็ฌฌiไฝไธบ1, ๅๆ นๆฎๅผๆ่ฟ็ฎ็็นๆงๆจ็ฎๅ่ฎพๆฏๅฆๆ็ซ
14
+ flag = max | current
15
+ for prefix in _set :
16
+ if prefix ^ flag in _set :
17
+ max = flag
18
+ break
19
+ return max
Original file line number Diff line number Diff line change 25
25
โย ย โโโ README.md
26
26
โย ย โโโ Solution.go
27
27
โย ย โโโ Solution.java
28
- โย ย โโโ Solution.js
28
+ โย ย โโโ Solution.js
29
+ โย ย โโโ Solution.py
29
30
โโโ 0004.Median of Two Sorted Arrays
30
31
โย ย โโโ README.md
31
32
โย ย โโโ Solution.cpp
767
768
โย ย โโโ Solution.java
768
769
โโโ 0421.Maximum XOR of Two Numbers in an Array
769
770
โย ย โโโ README.md
770
- โย ย โโโ Solution.java
771
+ โย ย โโโ Solution.java
772
+ โย ย โโโ Solution.py
771
773
โโโ 0423.Reconstruct Original Digits from English
772
774
โย ย โโโ Solution.cpp
773
775
โโโ 0427.Construct Quad Tree
You canโt perform that action at this time.
0 commit comments