Skip to content

Commit f7026fe

Browse files
committed
feat: add solutions to lc problems: No.0627, 1389
1 parent f99a761 commit f7026fe

File tree

8 files changed

+134
-4
lines changed

8 files changed

+134
-4
lines changed

solution/0600-0699/0627.Swap Salary/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@
3939

4040
### **SQL**
4141

42-
```
42+
```sql
4343
UPDATE salary
4444
SET
4545
sex = CASE sex

solution/0600-0699/0627.Swap Salary/README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -61,7 +61,7 @@ Result table:
6161

6262
### **SQL**
6363

64-
```
64+
```sql
6565
UPDATE salary
6666
SET
6767
sex = CASE sex

solution/1300-1399/1389.Create Target Array in the Given Order/README.md

Lines changed: 47 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -75,15 +75,61 @@ nums index target
7575
<!-- 这里可写当前语言的特殊实现逻辑 -->
7676

7777
```python
78-
78+
class Solution:
79+
def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
80+
target = []
81+
for i in range(len(nums)):
82+
target.insert(index[i], nums[i])
83+
return target
7984
```
8085

8186
### **Java**
8287

8388
<!-- 这里可写当前语言的特殊实现逻辑 -->
8489

8590
```java
91+
class Solution {
92+
public int[] createTargetArray(int[] nums, int[] index) {
93+
int n = nums.length;
94+
List<Integer> target = new ArrayList<>();
95+
for (int i = 0; i < n; ++i) {
96+
target.add(index[i], nums[i]);
97+
}
98+
int[] res = new int[n];
99+
for (int i = 0; i < n; ++i) {
100+
res[i] = target.get(i);
101+
}
102+
return res;
103+
}
104+
}
105+
```
106+
107+
### **C++**
108+
109+
```cpp
110+
class Solution {
111+
public:
112+
vector<int> createTargetArray(vector<int>& nums, vector<int>& index) {
113+
vector<int> target;
114+
for (int i = 0; i < nums.size(); ++i) {
115+
target.insert(target.begin() + index[i], nums[i]);
116+
}
117+
return target;
118+
}
119+
};
120+
```
86121
122+
### **Go**
123+
124+
```go
125+
func createTargetArray(nums []int, index []int) []int {
126+
target := make([]int, len(nums))
127+
for i, v := range nums {
128+
copy(target[index[i]+1:], target[index[i]:])
129+
target[index[i]] = v
130+
}
131+
return target
132+
}
87133
```
88134

89135
### **...**

solution/1300-1399/1389.Create Target Array in the Given Order/README_EN.md

Lines changed: 47 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -70,13 +70,59 @@ nums index target
7070
### **Python3**
7171

7272
```python
73-
73+
class Solution:
74+
def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
75+
target = []
76+
for i in range(len(nums)):
77+
target.insert(index[i], nums[i])
78+
return target
7479
```
7580

7681
### **Java**
7782

7883
```java
84+
class Solution {
85+
public int[] createTargetArray(int[] nums, int[] index) {
86+
int n = nums.length;
87+
List<Integer> target = new ArrayList<>();
88+
for (int i = 0; i < n; ++i) {
89+
target.add(index[i], nums[i]);
90+
}
91+
int[] res = new int[n];
92+
for (int i = 0; i < n; ++i) {
93+
res[i] = target.get(i);
94+
}
95+
return res;
96+
}
97+
}
98+
```
99+
100+
### **C++**
101+
102+
```cpp
103+
class Solution {
104+
public:
105+
vector<int> createTargetArray(vector<int>& nums, vector<int>& index) {
106+
vector<int> target;
107+
for (int i = 0; i < nums.size(); ++i) {
108+
target.insert(target.begin() + index[i], nums[i]);
109+
}
110+
return target;
111+
}
112+
};
113+
```
79114
115+
### **Go**
116+
117+
```go
118+
func createTargetArray(nums []int, index []int) []int {
119+
target := make([]int, len(nums))
120+
for i, v := range nums {
121+
copy(target[index[i]+1:], target[index[i]:])
122+
target[index[i]] = v
123+
}
124+
return target
125+
}
80126
```
81127

82128
### **...**
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
class Solution {
2+
public:
3+
vector<int> createTargetArray(vector<int>& nums, vector<int>& index) {
4+
vector<int> target;
5+
for (int i = 0; i < nums.size(); ++i) {
6+
target.insert(target.begin() + index[i], nums[i]);
7+
}
8+
return target;
9+
}
10+
};
Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
func createTargetArray(nums []int, index []int) []int {
2+
target := make([]int, len(nums))
3+
for i, v := range nums {
4+
copy(target[index[i]+1:], target[index[i]:])
5+
target[index[i]] = v
6+
}
7+
return target
8+
}
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
class Solution {
2+
public int[] createTargetArray(int[] nums, int[] index) {
3+
int n = nums.length;
4+
List<Integer> target = new ArrayList<>();
5+
for (int i = 0; i < n; ++i) {
6+
target.add(index[i], nums[i]);
7+
}
8+
int[] res = new int[n];
9+
for (int i = 0; i < n; ++i) {
10+
res[i] = target.get(i);
11+
}
12+
return res;
13+
}
14+
}
Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
class Solution:
2+
def createTargetArray(self, nums: List[int], index: List[int]) -> List[int]:
3+
target = []
4+
for i in range(len(nums)):
5+
target.insert(index[i], nums[i])
6+
return target

0 commit comments

Comments
 (0)