Sign in Subscribe

Topic

Codes

A collection of 37 issues

mark my first open source contribute to nx Vite

make vite:build executor return outfile for node executor by lengerrong · Pull Request #15002 · nrwl/nxfixed #14760 Current Behavior js:node executor can’t use vite:build as build targetExpected Behavior js:node executor should be able to use vite:build as build targetRelated Issue(s) #1476...GitHubnrwlfeat(vite): add

c++: Max Heap Template

https://en.wikipedia.org/wiki/Min-max_heap My simple implementation of max heap. Change the compare from > to < in below codes, you will get a min heap. template class MaxHeap { public: MaxHeap() { size_ = 0; capacity_ = 2; heap_ = new T[capacity_]; } MaxHeap(int capacity) { if (capacity >= 2) { heap_ = new T[capacity]

Trapping Rain Water

Question: http://www.lintcode.com/en/problem/trapping-rain-water/ Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example Given [0,1,0,2,1,0,1,3,2,1,2,1], return

Word Break III

Question http://www.lintcode.com/en/problem/word-break-iii/ Give a dictionary of words and a sentence with all whitespace removed, return the number of sentences you can form by inserting whitespaces to the sentence so that each word can be found in the dictionary. Example Given a String CatMat Given

Word Break II

Question Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. Example Gieve s = lintcode, dict = ["de", "ding", "co", "code", "lint"]. A solution is ["lint code", "lint co de"

Word Break

Question http://www.lintcode.com/en/problem/word-break/ Given a string s and a dictionary of words dict, determine if s can be break into a space-separated sequence of one or more dictionary words. Example Given s = "lintcode", dict = ["lint", "code"]. Return true because "lintcode" can be break as "lint

Lord's will

其实明天如何，你们还不知道。你们的生命是什么呢？你们原来是一片云雾，出现少时就不见了。 (雅各书 4:14 和合本) Why, you do not even know what will happen tomorrow. What is your life? You are a mist that appears for a little while and then vanishes. (James 4:14 NIV) 你们只当说：“主若愿意，我们就可以活着，也可以做这事，或做那事。” (雅各书 4:15 和合本) Instead,

Unique Paths III

Question http://www.lintcode.com/en/problem/unique-paths-iii/ Follow up for "Unique Paths II": https://acm.errong.win/uniquepathsii/ Now each grid contains a value, so each path also has a value. Find the sum of all the unique values paths. Example For example, [ [1,1,2], [1,2,3]

Unique Paths II

Question http://www.lintcode.com/en/problem/unique-paths-ii/ Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. Example For example, There is

Unique Paths

Question http://www.lintcode.com/en/problem/unique-paths/ A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid. How many