原创 lnk1181無法打開輸入文件_cuda.obj問題
vs更新後重新生成解決方案一直出現這問題"lnk1181 無法打開文件xxx_cuda.obj" 檢查發現是vs更新導致cl.exe路徑發生變化,更改後bug解決。
原创 Roman to Integer
Roman to Integer Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 t
原创 Min Cost Climbing Stairs
Min Cost Climbing Stairs--LeetCode (原題鏈接:點擊打開鏈接) On a staircase, the i-th step has some non-negative cost cost[i] assig
原创 STINGY SAT
8.3 STINGY SAT is the following problem: given a set of clauses(each a disjunction of literals) and an integer k, find
原创 String to Integer (atoi)--LeetCode
String to Integer (atoi) (原題鏈接:點擊打開鏈接) Implement atoi to convert a string to an integer. Hint: Carefully consider all
原创 Letter Combinations of a Phone Number--LeetCode
Letter Combinations of a Phone Number (原文鏈接:點擊打開鏈接) Given a digit string, return all possible letter combinations that
原创 Median of Two Sorted Arrays
Median of Two Sorted Arrays There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median
原创 3Sum Closest -- LeetCode
3Sum Closest (原題鏈接:點擊打開鏈接) Given an array S of n integers, find three integers in S such that the sum is closest to a
原创 Longest Palindromic Substring--LeetCode
Longest Palindromic Substring (原題鏈接:點擊打開鏈接) Given a string s, find the longest palindromic substring in s. You may as
原创 Integer to Roman--LeetCode
Integer to Roman (原題鏈接:點擊打開鏈接) Given an integer, convert it to a roman numeral. Input is guaranteed to be within the
原创 Palindrome Number--LeetCode
Palindrome Number (原題鏈接:點擊打開鏈接) Determine whether an integer is a palindrome. Do this without extra space. click to sh
原创 Regular Expression Matching--LeetCode
Regular Expression Matching (原題鏈接:點擊打開鏈接) Implement regular expression matching with support for '.' and '*'. '.' Mat
原创 Container With Most Water--LeetCode
Container With Most Water (原題鏈接:點擊打開鏈接) Given n non-negative integers a1, a2, ..., an, where each represents a point a
原创 Longest Common Prefix--LeetCode
Longest Common Prefix (原題鏈接:點擊打開鏈接) Write a function to find the longest common prefix string amongst an array of strin
原创 Reverse Integer--LeetCode
Reverse Integer (原題鏈接:點擊打開鏈接) Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -32