Skip to content

Instantly share code, notes, and snippets.

View cixuuz's full-sized avatar
💭
Vibe Coding

cixuuuuuuuuz cixuuz

💭
Vibe Coding
21 followers · 107 following
View GitHub Profile
@cixuuz
cixuuz / 108_0806.java
Created August 7, 2017 02:45
[108. Convert Sorted Array to Binary Search Tree] #leetcode
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@cixuuz
cixuuz / 654.py
Created August 6, 2017 02:36
[654. Maximum Binary Tree]
class Solution(object):
def constructMaximumBinaryTree(self, nums):
"""
:type nums: List[int]
:rtype: TreeNode
"""
if len(nums) == 0:
return None
val = max(nums)
@cixuuz
cixuuz / 653.py
Created August 6, 2017 02:30
[653. Two Sum IV - Input is a BST] #leetcode
class Solution:
cor = set()
def findTarget(self, root, k):
"""
:type root: TreeNode
:type k: int
:rtype: bool
"""
if root is None:
return False
@cixuuz
cixuuz / 116_0803.py
Last active August 5, 2017 17:08
[116 Populating Next Right Pointers in Each Node] #leetcode
# Definition for binary tree with next pointer.
# class TreeLinkNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# self.next = None
from collections import deque
@cixuuz
cixuuz / 124_0803.java
Last active August 5, 2017 01:27
[124 Binary Tree Maximum Path Sum] #leetcode
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@cixuuz
cixuuz / 110_0802.java
Last active August 5, 2017 01:27
[110 Balanced Binary Tree] #leetcode
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@cixuuz
cixuuz / 96_0801.java
Last active August 5, 2017 01:27
[96 Unique Binary Search Trees] #leetcode
public class Solution {
public int numTrees(int n) {
int[] dp = new int[n+1];
dp[0] = dp[1] = 1;
for (int i=2; i <= n; i++) {
for (int j=1; j <= i; j++) {
dp[i] += dp[j-1] * dp[i-j];
}
@cixuuz
cixuuz / 235_0801.java
Last active August 5, 2017 01:17
[235 Lowest Common Ancestor of a Binary Search Tree] #leetcode
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
@cixuuz
cixuuz / 173_0801.java
Last active August 5, 2017 01:17
[173 Binary Search Tree Iterator] #leetcode
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
@cixuuz
cixuuz / 100_08_01.java
Last active August 5, 2017 01:26
[100 Same Tree] #leetcode
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {