Difficulty: Easy
【題目】Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
翻譯
合并有序數(shù)組
難度系數(shù)：簡單
合并兩個有序數(shù)組。
// 時間復(fù)雜度n
[self getArrayA:@[@"1",@"4",@"7",@"10",@"15"] B:@[@"1",@"4",@"5",@"16",@"110"]];
- (NSArray *)getArrayA:(NSArray<NSString *> *)a B:(NSArray<NSString *> *)b {
NSMutableArray *c = [[NSMutableArray alloc] init];
int aInt = 0;
int bInt = 0;
for (int i = 0; i < a.count+b.count; i++) {
if (aInt == a.count) {
[c addObject:b[bInt]];
bInt ++;
}else if (bInt == b.count) {
[c addObject:a[aInt]];
aInt ++;
}else {
if (a[aInt].integerValue >= b[bInt].integerValue) {
[c addObject:b[bInt]];
bInt ++;
}else {
[c addObject:a[aInt]];
aInt ++;
}
}
}
return c;
}
