Implemented/Added #LeetCode324 (Wiggle Sort)

Problem: Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....

You may assume the input array always has a valid answer.

Example 1:

Input: nums = [1,5,1,1,6,4]
Output: [1,6,1,5,1,4]
Explanation: [1,4,1,5,1,6] is also accepted.

Java/WiggleSort.java

@@ -0,0 +1,39 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class WiggleSort {
+    public static void wiggleSort(int[] nums) {
+        int n = nums.length;
+        int[] sorted = nums.clone();
+        Arrays.sort(sorted);
+
+        int j = n - 1;
+        for (int i = 1; i < n; i += 2) {
+            nums[i] = sorted[j--];
+        }
+
+        for (int i = 0; i < n; i += 2) {
+            nums[i] = sorted[j--];
+        }
+    }
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+
+        System.out.print("Enter the number of elements: ");
+        int n = scanner.nextInt();
+
+        int[] nums = new int[n];
+        System.out.println("Enter the elements:");
+        for (int i = 0; i < n; i++) {
+            nums[i] = scanner.nextInt();
+        }
+
+        wiggleSort(nums);
+
+        System.out.println("Wiggled array:");
+        for (int num : nums) {
+            System.out.print(num + " ");
+        }
+    }
+}