Commit3a4e0d7

committed

add calculator

1 parent98b0580 commit3a4e0d7Copy full SHA for 3a4e0d7

File tree

+36

-2

lines changed

+36

-2

lines changed

Lines changed: 1 addition & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -23,13 +23,12 @@ var lowestCommonAncestor = function(root, p, q) {`
`23`	`23`	`returnroot;`
`24`	`24`	`};`
`25`	`25`
`26`		`-// or like this?`
	`26`	`+// or like this? ✅`
`27`	`27`	`varlowestCommonAncestor=function(root,p,q){`
`28`	`28`	`if(p.val>root.val&&q.val>root.val){`
`29`	`29`	`returnlowestCommonAncestor(root.right,p,q);`
`30`	`30`	`}elseif(p.val<root.val&&q.val<root.val){`
`31`	`31`	`returnlowestCommonAncestor(root.left,p,q);`
`32`	`32`	`}`
`33`	`33`	`returnroot;`
`34`		`-`
`35`	`34`	`};`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+/**`
	`2`	`+ * !!can always use Math.trunc() to get the integer part of a number`
	`3`	`+ *@param {string} s`
	`4`	`+ *@return {number}`
	`5`	`+ */`
	`6`	`+varcalculate=function(s){`
	`7`	`+varstack=[],`
	`8`	`+i,num=0,sign='+';`
	`9`	`+`
	`10`	`+for(i=0;i<s.length;i++){`
	`11`	`+if(!isNaN(s[i])&&s[i]!==' '){`
	`12`	`+num=num*10+parseInt(s[i],10);`
	`13`	`+}`
	`14`	`+if((isNaN(s[i]))\|\|i===s.length-1){`
	`15`	`+if(sign==='+'){`
	`16`	`+stack.push(num);`
	`17`	`+}elseif(sign==='-'){`
	`18`	`+stack.push(-num);`
	`19`	`+}elseif(sign==='*'){`
	`20`	`+stack.push(parseInt(stack.pop(),10)*num);`
	`21`	`+}elseif(sign==='/'){`
	`22`	`+stack.push(Math.trunc(parseInt(stack.pop(),10)/num));`
	`23`	`+}`
	`24`	`+sign=s[i];`
	`25`	`+num=0;`
	`26`	`+}`
	`27`	`+}`
	`28`	`+`
	`29`	`+for(i=0;i<stack.length;i++){`
	`30`	`+num+=stack[i];`
	`31`	`+}`
	`32`	`+`
	`33`	`+returnnum;`
	`34`	`+};`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -166,6 +166,7 @@`
`166`	`166`	`*[215. Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) -[Solution](./Medium/215-KthLargestElementInArray.js)`
`167`	`167`	`*[216. Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) -[Solution](./Medium/216-CombinationSumIII.js)`
`168`	`168`	`*[221. Maximal Square](https://leetcode.com/problems/maximal-square/) -[Solution](./Medium/221-maximalSquare.js)`
	`169`	`+*[227. Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) -[Solution](./Medium/227-calculatorII.js)`
`169`	`170`	`*[229. Majority Element II](https://leetcode.com/problems/majority-element-ii/) -[Solution](./Medium/229-majorityElementII.js)`
`170`	`171`	`*[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) -[Solution](./Medium/230-kthSmallestElementinBST.js)`
`171`	`172`	`*[236. Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) -[Solution](./Medium/236-lcaBinaryTree.js)`

Comments

(0)