ๅคๆฐๅ ็ด ๐๐๐๐็ฎๅ
่ฏพๅไฝไธ
้ฎ้ขๆ่ฟฐ
ๅๆ้พๆฅ๏ผ169. ๅคๆฐๅ ็ด
็ปๅฎไธไธชๅคงๅฐไธบ n ็ๆฐ็ป nums ๏ผ่ฟๅๅ ถไธญ็ๅคๆฐๅ ็ด ใๅคๆฐๅ ็ด ๆฏๆๅจๆฐ็ปไธญๅบ็ฐๆฌกๆฐ ๅคงไบ โ n/2 โ ็ๅ ็ด ใ
ไฝ ๅฏไปฅๅ่ฎพๆฐ็ปๆฏ้็ฉบ็๏ผๅนถไธ็ปๅฎ็ๆฐ็ปๆปๆฏๅญๅจๅคๆฐๅ ็ด ใ
็คบไพ 1๏ผ
่พๅ
ฅ๏ผnums = [3,2,3]
่พๅบ๏ผ3
็คบไพ 2๏ผ
่พๅ
ฅ๏ผnums = [2,2,1,1,1,2,2]
่พๅบ๏ผ2
ๆ็คบ๏ผ
n == nums.length1 <= n <= 5 * 10็4ๆฌกๆน-10็9ๆฌกๆน <= nums[i] <= 10็9ๆฌกๆน
ไปฃ็ ๅฎ็ฐ
Java
class Solution {
public int majorityElement(int[] nums) {
int sum = 1;
int x = nums[0];
for(int i = 1; i < nums.length; i++){
if(sum == 0){
sum = 1;
x = nums[i];
}else{
if(x == nums[i]){
sum++;
}else{
sum--;
}
}
}
return x;
}
}
Python
class Solution(object):
def majorityElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
sum = 1
x = nums[0]
for i in range(1, len(nums)):
if sum == 0:
sum = 1
x = nums[i]
else:
if x == nums[i]:
sum += 1
else:
sum -= 1
return x
C++
class Solution {
public:
int majorityElement(vector<int>& nums) {
int sum = 1;
int x = nums[0];
for (int i = 1; i < nums.size(); i++) {
if (sum == 0) {
sum = 1;
x = nums[i];
} else {
if (x == nums[i]) {
sum++;
} else {
sum--;
}
}
}
return x;
}
};
Go
func majorityElement(nums []int) int {
sum := 1
x := nums[0]
for i := 1; i < len(nums); i++ {
if sum == 0 {
sum = 1
x = nums[i]
} else {
if x == nums[i] {
sum++
} else {
sum--
}
}
}
return x
}