Daily-coding-/Sortedarraybyparity.java at main · Harshith2401/Daily-coding- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/*
Code
Testcase
Testcase
Test Result
905. Sort Array By Parity
Solved
Easy
Topics
premium lock icon
Companies
Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers.

Return any array that satisfies this condition.


Example 1:

Input: nums = [3,1,2,4]
Output: [2,4,3,1]
Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
Example 2:

Input: nums = [0]
Output: [0]


Constraints:

1 <= nums.length <= 5000
0 <= nums[i] <= 5000 */

class Solution {
    public int[] sortArrayByParity(int[] nums) {
        int i=0,j=nums.length-1,temp;
        while(i<j)
        {
            if(nums[i]%2>nums[j]%2)
            {
                temp=nums[i];
                nums[i]=nums[j];
                nums[j]=temp;
            }

            if(nums[i]%2==0) i++;
            if(nums[j]%2!=0) j--;
        }
        return nums;
    }
}
//tc=o(n)
//sc=o(1)