This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Docker image with msssql 2022 with full text search enabled | |
| # based on work in: https://github.com/Microsoft/mssql-docker | |
| # Base OS layer: Latest Ubuntu LTS | |
| FROM --platform=linux/amd64 ubuntu:focal | |
| # Install prerequistes since it is needed to get repo config for SQL server | |
| RUN export DEBIAN_FRONTEND=noninteractive && \ | |
| apt-get update && \ | |
| apt-get install -yq curl apt-transport-https gnupg && \ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| public class Solution { | |
| public int SingleNumber(int[] nums) { | |
| return nums.Aggregate((x, y) => x ^ y); | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Definition for singly-linked list. | |
| * public class ListNode { | |
| * public int val; | |
| * public ListNode next; | |
| * public ListNode(int x) { val = x; } | |
| * } | |
| */ | |
| public class Solution { | |
| public void DeleteNode(ListNode node) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Definition for a binary tree node. | |
| * public class TreeNode { | |
| * public int val; | |
| * public TreeNode left; | |
| * public TreeNode right; | |
| * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) { | |
| * this.val = val; | |
| * this.left = left; | |
| * this.right = right; |