题解 | #明明的随机数#
明明的随机数
https://www.nowcoder.com/practice/3245215fffb84b7b81285493eae92ff0
C++
#include <iostream> using namespace std; int main() { int N, n; while (cin >> N){ int a[1001] = {0}; while (N--){ cin >> n; a[n] = 1; } for(int i=0; i< 1001; i++){ if (a[i] != 0) { cout << i << endl; } } } return 0; }
Python3(哈希表)
num_list = [] sample_num = int(input().strip()) hash_list = {i:0 for i in range(1, 501)} for i in range(sample_num): hash_list[int(input().strip())] += 1 for i in range(1, 501): if hash_list[i] != 0: print(i)
Python3(快拍+set)
def quick_sort(buffer_list): leftp = [] rightp = [] if len(buffer_list) < 2: return buffer_list else: cur = buffer_list[0] for i in buffer_list[1:]: if cur > i: leftp.append(i) else: rightp.append(i) return quick_sort(leftp) + [cur] + quick_sort(rightp) if __name__ == "__main__": num_sample = int(input().strip()) sample_list = [] for i in range(num_sample): sample_list.append(int(input().strip())) sample_list = list(set(sample_list)) for i in quick_sort(sample_list): print(i)
Python3(快排处理重复)
def quick_sort(buffer_list): leftp = [] rightp = [] if len(buffer_list) < 2: return buffer_list else: cur = buffer_list[0] for i in buffer_list[1:]: if cur > i: leftp.append(i) elif cur == i: pass else: rightp.append(i) return quick_sort(leftp) + [cur] + quick_sort(rightp) # def rm_repeat(buffer_list): # hash_list = {i: 0 for i in buffer_list} # for i in if __name__ == "__main__": num_sample = int(input().strip()) sample_list = [] for i in range(num_sample): sample_list.append(int(input().strip())) # sample_list = list(set(sample_list)) for i in quick_sort(sample_list): print(i)
Python3(库函数)
num_list = [] for i in range(int(input().strip())): num_list.append(int(input().strip())) num_list = sorted(set(num_list)) for i in num_list: print(i)