Sign in

[C#][ASP.NET] The reference assemblies for framework .NETCore, Version=v5.0 were not found

So Stupid error while working
N2I -2021.02.26

While you git clone a dotnet 5 project or setting up a .Net Core 5 project, you got this in your build.

The Target framework in the properties of project can’t set to core 5 & can’t find .Net 5 in system. Only listing the .net framework


[C#][ASP.NET] The type or namespace name ‘Dictionary<,>’ could not be found

Some common errors from beginners to start a C# project
N2I -2020.10.29

using System.Collections.Generic; was not included in the project.

2. Solution

Add the following code to the top

using System.Collections;
using System.Collections.Generic;

[C#][ASP.NET] The name ‘Console’ does not exist in the current context

Some common errors from beginners to start a C# project
N2I -2020.10.29

System was not included in the project.

2. Solution

Add the following code to the top

using System;

[C#][ASP.net]ASP.net MVC & Visual Studio 2019 Quick Note

It’s just some random note I’ve made
N2I -2020.10.07

tool >> option >> environment >> keyboard
hotkey settings change to VSCode

[LeetCode][python3]0031. Next Permutation

Start the journey
N2I -2020.09.01

class Solution:
def nextPermutation(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""…

[Research][Report]淺讀NVIDIA Video Codec SDK

請多多指教!
NZI -2020.08.27 final edit

0. 前言:

本文嘗試以初學者報告的形式介紹 NVIDIA Video Codec SDK。
內文皆為個人結論,由於我不識專精C++,若有錯誤之處,還煩請告知,不勝感激!

1. 簡介 NVIDIA Video Codec SDK

Nvidia的官網上對於這組SDK的總結是這樣的 ”A comprehensive set of API including hig …


[LeetCode][python3]0030. Substring with Concatenation of All Words

Start the journey
N2I -2020.07.30

class Solution:
def findSubstring(self, s: str, words: List[str]) -> List[int]:

if not words:
retur …

[LeetCode][python3]0029. Divide Two Integers

Start the journey
N2I -2020.07.27

class Solution:
def divide(self, dividend: int, divisor: int) -> int:
d=False
if dividend<0:
d=not d
dividend=-dividend
if divisor<0:
divisor=-divisor
d=not d
res=dividend//divisor
if d:
res=-res
if res>2147483647:
return 2147483647
elif res<-2147483648:
return -2147483648
else:
return res

[LeetCode][python3]0028. Implement strStr()

Start the journey
N2I -2020.03.23

class Solution:
def strStr(self, haystack: str, needle: str) -> int:
#return haystack.find(needle)
if not needle:
return 0

for i in range(len(haystack)-len(needle)+1):
if haystack[i:i+len(needle)]==needle:
return i
return -1

[LeetCode][python3]0027. Remove Element

Start the journey
N2I -2020.03.23

class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
for i in reversed(range(len(nums))):
if nums[i]==val:
del nums[i]
return len(nums)

N2I

HI I’m N2I. Now a Computer Science and Engineering Student of NCHU in Taiwan. Check out more about me in https://nzi2020.blogspot.com/

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store