暴力或双指针
考虑定义双指针 i , j 分列数组左右两端,循环执行:
指针 ii从左向右寻找偶数;
指针 j 从右向左寻找奇数;
将 偶数 nums[i]和 奇数 nums[j]交换。
可始终保证: 指针 ii左边都是奇数,指针 j右边都是偶数 。
记录链表复制容易犯的错误。
'''
#错误原因需要好好理解
class Solution:
def exchange(self, nums):
ans=[]
tmp=nums
#https://blog.csdn.net/qq_37891604/article/details/124528827
#https://blog.csdn.net/weixin_45492560/article/details/120613978
for i in range(len(nums)):
if nums[i]%2:
print(i)
ans.append(nums[i])
tmp.pop(i)
#这里对tmp修改,nums也会改变
#因为是可变对象,指向同一个引用
ans.extend(tmp)
return ans
'''
'''
class Solution:
def exchange(self, nums):
ans=[]
for i in nums:
if i%2:
ans.append(i)
for i in nums:
if i%2==0:
ans.append(i)
return ans
'''
class Solution:
def exchange(self, nums):
i,j=0,len(nums)-1
while i<j:
while i<j and nums[i]%2:i+=1
while i<j and nums[j]%2==0:j-=1
nums[i],nums[j]=nums[j],nums[i]
return nums
a=Solution()
nums = [1,2,3,4]
print(a.exchange(nums))