学习剑指offer 第13天
21 调整数组顺序使奇数位于偶数前面
- 方法一:分别构建数组保存奇数和偶数,再合并奇数和偶数
public int[] exchange(int[] nums) {
int[] odds = new int[nums.length];
int[] eval = new int[nums.length];
int ocount = 0;
int eval_count = 0;
for(int i = 0; i < nums.length; i++){
if(nums[i] % 2 == 0){
eval[eval_count++] = nums[i];
}else{
odds[ocount++] = nums[i];
}
}
if(ocount == nums.length) return nums;
int count = 0;
for(int i = 0; i < ocount; i++){
nums[count++] = odds[i];
}
for(int i = 0; i < eval_count; i++){
nums[count++] = eval[i];
}
return nums;
}
- 方法二:快慢指针;left指针指向小于right位置的偶数,right遍历整个数组,每当right为奇数时,要与left指向的数组元素进行交换
public int[] exchange(int[] nums) {
int left = -1;
int right = 0;
for(; right < nums.length; right++){
if(nums[right] % 2 == 0){
if(left == -1 || nums[left] % 2 != 0) left = right;
}else{
if(left != -1 && nums[left] % 2 == 0){
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
for(int i = left + 1; i <= right; i++){
if(nums[i] % 2 == 0){
left = i;
break;
}
}
}
}
}
return nums;
}
- 方法三:双指针:left从左向右遍历找到偶数,right从右向左遍历找到奇数,二者交换位置
public int[] exchange(int[] nums) {
int left = 0;
int right = nums.length - 1;
while(true){
//左指针找偶数
while(left < nums.length && nums[left] % 2 != 0){
left++;
}
//右指针找奇数
while(right >= 0 && nums[right] % 2 == 0){
right--;
}
//已经结束
if(left >= right) break;
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
}
return nums;
}
57 和为s的两个数字
- 题目描述
输入一个递增排序的数组和一个数字s,在数组中查找两个数,使得它们的和正好是s。如果有多对数字的和等于s,则输出任意一对即可。 - 解答
法一:使用数组保存目前已有的数字,每当遍历到一个数字时,返回标志数组中查看所需元素是否已经出现
public int[] twoSum(int[] nums, int target) {
boolean[] flag = new boolean[target + 1];
// Arrays.fill(flag, false);
for(int i = 0; i <nums.length; i++){
if(nums[i] > target) return new int[2];
//已经找到
if(flag[target - nums[i]]) return new int[]{nums[i], target - nums[i]};
flag[nums[i]] = true;
}
return new int[2];
}
法二:使用双指针
public int[] twoSum(int[] nums, int target) {
//双指针
int left = 0, right = nums.length - 1;
while(left < right){
if(nums[left] + nums[right] == target) return new int[]{nums[left], nums[right]};
if(nums[left] + nums[right] > target) right--;
else left++;
}
return new int[2];
58-1 翻转单词顺序
- 题目描述
输入一个英文句子,翻转句子中单词的顺序,但单词内字符的顺序不变。为简单起见,标点符号和普通字母一样处理。例如输入字符串"I am a student. “,则输出"student. a am I”。 - 解答
法一:
public String reverseWords(String s) {
if(s.length() == 0) return s;
String[] str = s.trim().split(" ");
StringBuilder sb = new StringBuilder();
for(int i = str.length - 1; i > 0; i--){
if(str[i].equals("")) continue;
sb.append(str[i].trim());
sb.append(' ');
}
sb.append(str[0].trim());
return sb.toString();
}
法二:
先翻转整个字符串,再翻转每个单词
class Solution {
public String reverseWords(String s) {
if(s.length() == 0) return s;
//去掉字符串内的多余空格
StringBuilder sb = removeSpace(s);
//反转字符串
reverse(sb, 0, sb.length() - 1);
//翻转每一个单词
reverseWord(sb);
return sb.toString();
}
public StringBuilder removeSpace(String s){
int left = 0;
while(left < s.length() && s.charAt(left) == ' ') left++;
int right = s.length() - 1;
while(right >= 0 && s.charAt(right) == ' ') right--;
StringBuilder sb = new StringBuilder();
for(int i = left; i <= right; i++){
char c = s.charAt(i);
if(c != ' ' || c == ' ' && s.charAt(i - 1) != ' ') sb.append(s.charAt(i));
}
return sb;
}
public void reverse(StringBuilder sb, int begin, int end){
while(begin < end){
char c = sb.charAt(begin);
sb.setCharAt(begin, sb.charAt(end));
sb.setCharAt(end, c);
begin++;
end--;
}
}
public void reverseWord(StringBuilder sb){
int begin = 0;
int i = 0;
for(; i < sb.length(); i++){
if(sb.charAt(i) == ' '){
reverse(sb, begin, i - 1);
begin = i + 1;
}
}
reverse(sb, begin, i - 1);
}
}