Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 309eef0

Browse files
authored
Merge pull request #9 from Tahirc1/code-add
88th problem
2 parents 689072c + 7f4d437 commit 309eef0

File tree

4 files changed

+60
-0
lines changed

4 files changed

+60
-0
lines changed
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
var deleteDuplicates = function(head) {
2+
let obj = {}
3+
while(head != null){
4+
obj[head.val] = (obj[head.val])?obj[head.val]+1:1
5+
head = head.next
6+
}
7+
let a = []
8+
for(let c in obj){
9+
if(obj[c] == 1){a.push(c)}
10+
}
11+
a.sort((a,b)=>{return a-b})
12+
let n = new ListNode()
13+
let ans = n
14+
for(let i = 0 ; i < a.length ; i++){
15+
n = n.next = new ListNode(a[i])
16+
}
17+
return ans.next
18+
};
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
var deleteDuplicates = function(head) {
2+
let a = new Set()
3+
let b = new ListNode(0)
4+
let c = b
5+
while(head != null ){
6+
a.add(head.val)
7+
head = head.next
8+
}
9+
for(let x of a){
10+
b = b.next = new ListNode(x)
11+
}
12+
return c.next
13+
};

‎81-90/86. Partition List.js‎

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
var partition = function(head, x) {
2+
if(head === null) return head;
3+
const leftDummy = new ListNode(0);
4+
const rightDummy = new ListNode(0);
5+
let left = leftDummy;
6+
let right = rightDummy;
7+
while(head){
8+
if(head.val < x) {
9+
left.next = head;
10+
left = head;
11+
} else {
12+
right.next = head;
13+
right = head;
14+
}
15+
head = head.next;
16+
}
17+
right.next = null;
18+
left.next = rightDummy.next;
19+
return leftDummy.next;
20+
};

‎81-90/88. Merge Sorted Array.js‎

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
var merge = function(nums1, m, nums2, n){
2+
nums1.length = m
3+
nums2.length = n
4+
let ans = nums1.concat(nums2)
5+
ans.sort((a,b)=>a-b)
6+
for(let i = 0 ; i < ans.length ; i++){
7+
nums1[i] = ans[i]
8+
}
9+
};

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /