![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
面试高频
Katrina~
哇你好鸭
展开
-
NC4 判断链表中是否有环
public class Solution { public boolean hasCycle(ListNode head) { ListNode fast = head; ListNode slow = head; while (fast != null && fast.next != null) { fast = fast.next.next; slow = slow.原创 2022-04-18 14:20:46 · 502 阅读 · 0 评论 -
NC88 寻找第K大
import java.util.*;public class Finder { public int findKth(int[] a, int n, int K) { // write code here return findK(a, 0, n-1, K); } public static int partition(int[] arr, int left, int right) { int pivot = arr[l原创 2022-04-17 19:49:06 · 259 阅读 · 0 评论 -
NC54 三数之和
class Solution {public: vector<vector<int> > threeSum(vector<int> &num) { vector<vector<int>>ans; sort(num.begin(),num.end()); for(int i=0;i<num.size();i++){ if(num[i]>0) brea原创 2022-04-16 18:49:08 · 179 阅读 · 0 评论 -
NC27 集合的所有子集(一)
class Solution {public: vector<vector<int>>ans; void dfs(vector<int> &S,vector<int>&v,int index){ ans.push_back(v); for(int i=index;i<S.size();i++){ v.push_back(S[i]);原创 2022-04-16 18:21:06 · 337 阅读 · 0 评论 -
NC26 括号生成
class Solution {public: vector<string>ans; void dfs(string s,int l,int r,int n){ if(l>n||r>n||r>l) return; if(l==r&&r==n){ ans.push_back(s); return; } dfs(s+"(",l+1,r,n原创 2022-04-16 18:09:48 · 581 阅读 · 0 评论