Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int nums=new int[10];
- for(int i=0;i<nums.length; i++){
- new[i]=nums[nums.length-i-1];
- }
- public static boolean checkPalindrome(int[]nums){
- boolean isPalindrome=true;
- int count=0;
- while(isPalindrome&&count<nums.length/2){
- if(nums[count]!=nums[nums.length-count-1]){
- isPalindrome=false;
- }
- count++;
- }
- return isPalindrome;
- }
- without making a new array, can you reverse the positions of all elements in an array?
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement