小米盒子pro版发布了。4K!# PDA - 掌中宝
s*e
1 楼
今天电面刚被问的一道题:
Given a target number x and an array of unique integers, return all possible
formulas that get x using any number of integers in the array and +,-,*,/
(No parenthesis allowed), return null if not exist
当时第一反应是permutation,但做起来不太容易。大家有什么思路?Complexity如何
?
Given a target number x and an array of unique integers, return all possible
formulas that get x using any number of integers in the array and +,-,*,/
(No parenthesis allowed), return null if not exist
当时第一反应是permutation,但做起来不太容易。大家有什么思路?Complexity如何
?