摘要:
https://leetcode.com/problems/next-permutation/discuss/13865/Sharing-my-clean-and-easy-understand-java-code-with-explanation?page=3 在当前序列中,从尾端往前寻找两个相邻 阅读全文
摘要:
1 class Solution { 2 public int divide(int dividend, int divisor) { 3 long count = 0; 4 if(dividend == 0) return 0; 5 //divisor和dividend都要变成正数和long再进行处理 6 if... 阅读全文